k-Watson-Crick Petri net controlled grammars

Mohamad Jan, Nurhidaya and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod (2015) k-Watson-Crick Petri net controlled grammars. International Journal of Applied Mathematics and Statistics, 53 (3). pp. 99-106. ISSN 0973-7545 (O), 0973-1377 (P)

PDF - Published Version Restricted to Repository staff only Download (105kB) | Request a copy

Abstract

A Watson-Crick Petri net is an extension of a Watson-Crick automaton where the control by finite automaton is replaced by a Petri net. By adapting the different types of Petri nets, various variants of Watson-Crick Petri nets and Watson-Crick Petri net controlled grammars such as reverse Watson-Crick Petri net and many more can be defined. In this paper, a modelling of k-Watson-Crick Petri net controlled grammars is introduced.

Item Type:	Article (Journal)
Additional Information:	6846/44572
Uncontrolled Keywords:	Watson-Crick automata, Petri net, grammar, context free, Petri net controlled grammar
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 Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	Dr. Sherzod Turaev
Date Deposited:	28 Sep 2015 13:13
Last Modified:	10 Nov 2015 00:38
URI:	http://irep.iium.edu.my/id/eprint/44572

Actions (login required)

View Item