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

Full description

Bibliographic Details
Main Authors: Turaev, Sherzod, Selamat, Mohd Hasan
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
_version_ 1825945519512354816
author Turaev, Sherzod
Selamat, Mohd Hasan
author_facet Turaev, Sherzod
Selamat, Mohd Hasan
author_sort Turaev, Sherzod
collection UPM
description 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.
first_indexed 2024-03-06T07:32:47Z
format Article
id upm.eprints-14911
institution Universiti Putra Malaysia
language English
English
last_indexed 2024-03-06T07:32:47Z
publishDate 2010
publisher Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia
record_format dspace
spelling upm.eprints-149112016-01-19T01:25:07Z http://psasir.upm.edu.my/id/eprint/14911/ Grammars controlled by petri nets with inhibitor arcs. Turaev, Sherzod Selamat, Mohd Hasan 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. Ibnu Sina Institute for Fundamental Science Studies, Universiti Teknologi Malaysia 2010 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/14911/1/Grammars%20controlled%20by%20petri%20nets%20with%20inhibitor%20arcs.pdf Turaev, Sherzod and Selamat, Mohd Hasan (2010) Grammars controlled by petri nets with inhibitor arcs. Journal of Fundamental Sciences, 6 (2). pp. 98-103. ISSN 1823-626X http://jfs.ibnusina.utm.my English
spellingShingle Turaev, Sherzod
Selamat, Mohd Hasan
Grammars controlled by petri nets with inhibitor arcs.
title Grammars controlled by petri nets with inhibitor arcs.
title_full Grammars controlled by petri nets with inhibitor arcs.
title_fullStr Grammars controlled by petri nets with inhibitor arcs.
title_full_unstemmed Grammars controlled by petri nets with inhibitor arcs.
title_short Grammars controlled by petri nets with inhibitor arcs.
title_sort grammars controlled by petri nets with inhibitor arcs
url http://psasir.upm.edu.my/id/eprint/14911/1/Grammars%20controlled%20by%20petri%20nets%20with%20inhibitor%20arcs.pdf
work_keys_str_mv AT turaevsherzod grammarscontrolledbypetrinetswithinhibitorarcs
AT selamatmohdhasan grammarscontrolledbypetrinetswithinhibitorarcs