Capacity Bounded Grammars and Petri Nets

Date
Authors
Stiebe, Ralf
Turaev, Sherzod
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
Keywords
Computer Science - Formal Languages and Automata Theory
Citation
Collections