Grammars Controlled by Petri Nets with Place Capacities

Author

Selamat, Mohd Hasan ; Turaev, Sherzod

Author_Institution

Fac. of Comput. Sci. & Inf. Technol., Univ. Putra Malaysia, Serdang, Malaysia

fYear

2010

fDate

7-10 May 2010

Firstpage

51

Lastpage

55

Abstract

A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules and nonterminals of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is enabled at the initial marking and finished at a final marking of the net. In the paper we investigate the generative power of grammars controlled by Petri nets with place capacities.

Keywords

Petri nets; formal languages; grammars; Petri net controlled grammar; place capacities; production rules; terminal strings; Biological system modeling; Communication system control; Computational biology; Computer science; Formal languages; Petri nets; Power generation; Production; Research and development; Sequences; Formal languages and grammars; Petri net controlled grammars; Petri nets; grammars with regulated rewriting;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Research and Development, 2010 Second International Conference on

Conference_Location

Kuala Lumpur

Print_ISBN

978-0-7695-4043-6

Type

conf

DOI

10.1109/ICCRD.2010.43

Filename

5489410