Languages of watson-crick petri net
Watson-Crick automata are one of the automata types that are used for transitions with two reading heads. This automata work on double stranded sequences related by a complementarity relation similar with the Watson-Crick complementarity of DNA molecules. Watson-Crick automata can be related to a Pe...
Main Authors: | Mohamad Jan, Nurhidaya, Fong, Wan Heng, Sarmin, Nor Haniza, Turaev, Sherzod |
---|---|
Format: | Article |
Language: | English English |
Published: |
Universiti Teknologi Malaysia
2014
|
Subjects: | |
Online Access: | http://irep.iium.edu.my/39720/ http://irep.iium.edu.my/39720/ http://irep.iium.edu.my/39720/1/Languages_of_Watson-Crick_Petri_Nets_Jurnal_Teknologi_70%285%29_2014%2C_pp_97-101.pdf http://irep.iium.edu.my/39720/4/39720_Languages%20of%20watson-crick%20petri%20net_SCOPUS.pdf |
Similar Items
-
k-Watson-Crick Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015) -
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)