Capacity bounded grammars and petri nets

Ralf Stiebe, Sherzod Turaev

Research output: Contribution to journalConference articlepeer-review

7 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)193-203
Number of pages11
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Publication statusPublished - Jul 30 2009
Externally publishedYes
Event11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009 - Magdeburg, Germany
Duration: Jul 6 2009Jul 9 2009

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Capacity bounded grammars and petri nets'. Together they form a unique fingerprint.

Cite this