Skip to main content
Conference Proceedings

k-Petri net controlled grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5196 LNCS 209-220
DOI: 10.1007/978-3-540-88282-4_20
17Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dassow, J., & Turaev, S. (2008). k-Petri net controlled grammars. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5196 LNCS, pp. 209–220). https://doi.org/10.1007/978-3-540-88282-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free