Place-Labeled Petri Net Controlled Grammars

Mohamad Jan, Nurhidaya and Turaev, Sherzod and Fong, Wan Heng and Sarmin, Nor Haniza (2016) Place-Labeled Petri Net Controlled Grammars. ScienceAsia. ISSN 1513-1874 (In Press)

Preview

PDF Download (411kB) | Preview

Abstract

A place-labeled Petri net (pPN) controlled grammar is a context-free grammar equipped with a Petri net and a function which maps places of the net to the productions of the grammar. The language consists of all terminal strings that can be obtained by simultaneously applying of the rules of multisets which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. In this paper, we study the generative power and structural properties of pPN controlled grammars. We show that pPN controlled grammars have the same generative power as matrix grammars. Moreover, we prove that for each pPN controlled grammar, we can construct an equivalent place-labeled ordinary net controlled grammar.

Item Type:	Article (Journal)
Additional Information:	6846/53717
Uncontrolled Keywords:	Petri nets, context-free grammars, Petri net controlled grammars, computational power, structural properties
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology > Department of Library & Information Science Kulliyyah of Information and Communication Technology > Department of Library & Information Science
Depositing User:	Dr. Sherzod Turaev
Date Deposited:	02 Jan 2017 01:11
Last Modified:	02 Jan 2017 01:11
URI:	http://irep.iium.edu.my/id/eprint/53717

Actions (login required)

View Item