k-Petri net controlled grammars

Jürgen Dassow; Sherzod Turaev

doi:10.1007/978-3-540-88282-4_20

k-Petri net controlled grammars

Jürgen Dassow, Sherzod Turaev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

17 Citations (Scopus)

Abstract

We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.

Original language	English
Title of host publication	Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers
Pages	209-220
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-540-88282-4_20
Publication status	Published - 2008
Externally published	Yes
Event	2nd International Conference on Language and Automata Theory and Applications, LATA 2008 - Tarragona, Spain Duration: Mar 13 2008 → Mar 19 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5196 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Conference on Language and Automata Theory and Applications, LATA 2008
Country/Territory	Spain
City	Tarragona
Period	3/13/08 → 3/19/08

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-88282-4_20

Cite this

Dassow, J., & Turaev, S. (2008). k-Petri net controlled grammars. In Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers (pp. 209-220). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5196 LNCS). https://doi.org/10.1007/978-3-540-88282-4_20

k-Petri net controlled grammars. / Dassow, Jürgen; Turaev, Sherzod.
Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers. 2008. p. 209-220 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5196 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Dassow, J & Turaev, S 2008, k-Petri net controlled grammars. in Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5196 LNCS, pp. 209-220, 2nd International Conference on Language and Automata Theory and Applications, LATA 2008, Tarragona, Spain, 3/13/08. https://doi.org/10.1007/978-3-540-88282-4_20

@inproceedings{0ef0be9147014362879ebbd35ea6644f,

title = "k-Petri net controlled grammars",

abstract = "We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.",

author = "J{\"u}rgen Dassow and Sherzod Turaev",

year = "2008",

doi = "10.1007/978-3-540-88282-4_20",

language = "English",

isbn = "3540882812",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "209--220",

booktitle = "Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers",

note = "2nd International Conference on Language and Automata Theory and Applications, LATA 2008 ; Conference date: 13-03-2008 Through 19-03-2008",

}

TY - GEN

T1 - k-Petri net controlled grammars

AU - Dassow, Jürgen

AU - Turaev, Sherzod

PY - 2008

Y1 - 2008

N2 - We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.

AB - We introduce a new type of regulated grammars using Petri nets as a control of the derivations of a context-free grammar. We investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars.

UR - http://www.scopus.com/inward/record.url?scp=56449091096&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=56449091096&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-88282-4_20

DO - 10.1007/978-3-540-88282-4_20

M3 - Conference contribution

AN - SCOPUS:56449091096

SN - 3540882812

SN - 9783540882817

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 209

EP - 220

BT - Language and Automata Theory and Applications - Second International Conference, LATA 2008, Revised Papers

T2 - 2nd International Conference on Language and Automata Theory and Applications, LATA 2008

Y2 - 13 March 2008 through 19 March 2008

ER -

k-Petri net controlled grammars

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this