Open Access Open Access  Restricted Access Subscription or Fee Access

k-Watson-Crick Petri Net Controlled Grammars

N. Mohamad Jan, W. H. Fong, N. H. Sarmin, S. Turaev

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.

Keywords


Watson-Crick automata, Petri net, grammar, context-free, Petri net controlled grammar.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.