Capacity bounded grammars and petri nets

Ralf Stiebe; Sherzod Turaev

doi:10.4204/EPTCS.3.18

Capacity bounded grammars and petri nets

Ralf Stiebe, Sherzod Turaev

Research output: Contribution to journal › Conference article › peer-review

7 Citations (Scopus)

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.

Original language	English
Pages (from-to)	193-203
Number of pages	11
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	3
DOIs	https://doi.org/10.4204/EPTCS.3.18
Publication status	Published - Jul 30 2009
Externally published	Yes
Event	11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009 - Magdeburg, Germany Duration: Jul 6 2009 → Jul 9 2009

ASJC Scopus subject areas

Software

Access to Document

10.4204/EPTCS.3.18

Cite this

@article{3d889c240f954e2581b01ab3708daf31,

title = "Capacity bounded grammars and petri nets",

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.",

author = "Ralf Stiebe and Sherzod Turaev",

note = "Publisher Copyright: {\textcopyright} R. Stiebe, S. Turaev; 11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009 ; Conference date: 06-07-2009 Through 09-07-2009",

year = "2009",

month = jul,

day = "30",

doi = "10.4204/EPTCS.3.18",

language = "English",

volume = "3",

pages = "193--203",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

publisher = "Open Publishing Association",

}

TY - JOUR

T1 - Capacity bounded grammars and petri nets

AU - Stiebe, Ralf

AU - Turaev, Sherzod

N1 - Publisher Copyright: © R. Stiebe, S. Turaev

PY - 2009/7/30

Y1 - 2009/7/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85027003044&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027003044&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.3.18

DO - 10.4204/EPTCS.3.18

M3 - Conference article

AN - SCOPUS:85027003044

SN - 2075-2180

VL - 3

SP - 193

EP - 203

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

T2 - 11th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2009

Y2 - 6 July 2009 through 9 July 2009

ER -

Capacity bounded grammars and petri nets

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this