A capacity bounded grammar is a grammar whose derivations are restricted by assigning a bound to the number of every nonterminal symbol in the sentential forms. In the paper the generative power and closure properties of capacity bounded grammars and their Petri net controlled counterparts are investigated.
|Number of pages||11|
|Journal||Electronic Proceedings in Theoretical Computer Science, EPTCS|
|Publication status||Published - Jul 30 2009|
|Event||11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009 - Magdeburg, Germany|
Duration: Jul 6 2009 → Jul 9 2009
ASJC Scopus subject areas