Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
k-Petri Net Controlled Grammars
Language and Automata Theory and Applications
Parsing algorithms for grammars with regulated rewriting
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
An extended Earley's algorithm for Petri net controlled grammars without λ rules and cyclic rules
Theoretical Computer Science
| Hi-index | 0.00 |
A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net, whose places and transitions correspond to the nonterminals and the production rules of the grammar, respectively, and tokens are separate instances of the nonterminals in a sentential form. Therefore, the control of the derivations in a context-free grammar can be implemented by adding some features to the associated of petri net. The addition of new places and new arcs from/to these new places to/from transitions of the net leads grammars controlled by k-Petri, nets, i.e., Petri nets with additional k places. In the paper we investigate the generative power and give closure properties of the families of languages generated by such Petri net controlled grammars, in particular, we show that these families form an infinite hierarchy with respect to the numbers of additional places.