Capacity Bounded Grammars and Petri Nets
classification
💻 cs.FL
keywords
boundedcapacitygrammargrammarspetriassigningboundclosure
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.