Grammars controlled by petri nets with inhibitor arcs.
A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and the sequence of rules in every terminal derivation correspond...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
2010
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/14911/1/Grammars%20controlled%20by%20petri%20nets%20with%20inhibitor%20arcs.pdf http://psasir.upm.edu.my/id/eprint/14911/ http://jfs.ibnusina.utm.my |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A Petri net controlled grammar is a grammar equipped with a Petri net whose transitions are labeled with production rules of the grammar, and the associated language consists of all terminal strings which can be derived in the grammar and 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 this paper we define grammars controlled by Petri nets with inhibitor arcs and investigate their computational capacities. |
|---|