文章基本信息

标题：Capacity Bounded Grammars and Petri Nets
本地全文：下载
作者：Ralf Stiebe ; Sherzod Turaev
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2009
卷号：3
页码：193-203
DOI：10.4204/EPTCS.3.18
出版社：Open Publishing Association
摘要：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.