arXiv Open Access 2009

Capacity Bounded Grammars and Petri Nets

Ralf Stiebe Sherzod Turaev

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.FL

Penulis (2)

Ralf Stiebe

Sherzod Turaev

Format Sitasi

APA MLA BibTeX

Stiebe, R., Turaev, S. (2009). Capacity Bounded Grammars and Petri Nets. https://arxiv.org/abs/0907.5136

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2009
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓