Capacity Bounded Grammars and Petri Nets
Formal Languages and Automata Theory
2009-07-30 v1
Abstract
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.
Cite
@article{arxiv.0907.5136,
title = {Capacity Bounded Grammars and Petri Nets},
author = {Ralf Stiebe and Sherzod Turaev},
journal= {arXiv preprint arXiv:0907.5136},
year = {2009}
}