k-Watson-Crick Petri net controlled grammars
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-Cric...
| Main Authors: | Mohamad Jan, Nurhidaya, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CESER Publications
2015
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/44572/ http://irep.iium.edu.my/44572/ http://irep.iium.edu.my/44572/1/048_k-Watson-Crick_Petri_Net_Controlled_Grammars.pdf |
Similar Items
-
Languages of watson-crick petri net
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014) -
Reverse Watson-Crick Petri nets
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014) -
Watson-Crick petri net languages: the effect of labeling strategies
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014) -
Watson-Crick Petri net languages with finite sets of final markings
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014) -
Place-Labeled Petri Net Controlled Grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2016)