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.
Year
DOI
Venue
2008
10.1007/978-3-540-88282-4_20
LATA
Keywords
Field
DocType
context-free grammar,generative power,closure property,petri net,new type,controlled grammar,regulated grammar,controlled grammars,context free grammar
Rule-based machine translation,Discrete mathematics,Generative power,Petri net,Programming language,Computer science,Grammar,Artificial intelligence
Conference
Volume
ISSN
Citations 
5196
0302-9743
5
PageRank 
References 
Authors
0.67
3
2
Name
Order
Citations
PageRank
Jürgen Dassow1530118.27
Sherzod Turaev23110.81