Computational properties of Watson-Crick context-free grammars
Deoxyribonucleic acid, or popularly known as DNA, continues to inspire many theoretical computing models, such as sticker systems and Watson-Crick grammars. Sticker systems are the abstraction of ligation processes performed on DNA, while Watson-Crick grammars are models motivated from Watson-Crick...
| Main Authors: | Mohamad Zulkufli, Nurul Liyana, Turaev, Sherzod, Mohd Tamrin, Mohd Izzuddin, Az Eddine, Messikh, Alshaikhli, Imad Fakhri Taha |
|---|---|
| Format: | Proceeding Paper |
| Language: | English English |
| Published: |
The Institute of Electrical and Electronics Engineers, Inc.
2016
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/50833/ http://irep.iium.edu.my/50833/1/50833_Computational_Properties_of_Watson-Crick1.pdf http://irep.iium.edu.my/50833/4/50833_Computational%20Properties_scopus.pdf |
Similar Items
Watson-Crick linear grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2015)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2015)
Watson-Crick Linear Grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2019)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2019)
Watson–Crick context-free grammars: Grammar simplifications and a parsing algorithm
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2018)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2018)
Closure properties of Watson-Crick grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2015)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2015)
The computational power of Watson-Crick grammars: Revisited
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2016)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2016)
Generative power and closure properties of Watson-Crick grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2016)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2016)
Closure properties of Watson-Crick Grammars
by: Nurul Liyana Binti Mohamad Zulkifli, Liyana, et al.
Published: (2015)
by: Nurul Liyana Binti Mohamad Zulkifli, Liyana, et al.
Published: (2015)
DNA computing model watson-crick grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2017)
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2017)
Weighted Watson-Crick Automata
by: Mohd Tamrin, Mohd Izzuddin, et al.
Published: (2013)
by: Mohd Tamrin, Mohd Izzuddin, et al.
Published: (2013)
Weighted Watson-Crick automata
by: Mohd Tamrin, Mohd Izzuddin, et al.
Published: (2014)
by: Mohd Tamrin, Mohd Izzuddin, et al.
Published: (2014)
Static watson-crick linear grammars and its computational power
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2019)
by: Abdul Rahman, Aqilahfarhana, et al.
Published: (2019)
k-Watson-Crick Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015)
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015)
Weighted Watson-crick automata and applications in halal authentication
by: Mohd Tamrin, Mohd Izzuddin, et al.
Published: (2016)
by: Mohd Tamrin, Mohd Izzuddin, et al.
Published: (2016)
Reverse Watson-Crick Petri nets
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)
Languages of watson-crick petri net
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)
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)
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)
by: Mohamad Jan, Nurhidaya, et al.
Published: (2014)
Closure properties of Watson-Crick Petri net
by: Mohamad Jan, Nurhidaya, et al.
Published: (2018)
by: Mohamad Jan, Nurhidaya, et al.
Published: (2018)
Concurrent context-free grammars
by: Mavlankulov, Gairatzhan, et al.
Published: (2014)
by: Mavlankulov, Gairatzhan, et al.
Published: (2014)
Binary context-free grammars
by: Turaev, Sherzod, et al.
Published: (2020)
by: Turaev, Sherzod, et al.
Published: (2020)
Nonterminal complexity of weakly conditional grammars
by: Turaev, Sherzod, et al.
Published: (2014)
by: Turaev, Sherzod, et al.
Published: (2014)
Concurrent context-free grammars
by: Mavlankulov, Gairatzhan, et al.
Published: (2013)
by: Mavlankulov, Gairatzhan, et al.
Published: (2013)
Context-free petri net controlled grammars under parallel firing strategy
by: Mavlankulov, Gairatzhan, et al.
Published: (2016)
by: Mavlankulov, Gairatzhan, et al.
Published: (2016)
Multiset controlled grammars
by: Ashaari, Salbiah, et al.
Published: (2017)
by: Ashaari, Salbiah, et al.
Published: (2017)
An overview of cryptosystems based on finite automata
by: Khaleel, Ghassan, et al.
Published: (2016)
by: Khaleel, Ghassan, et al.
Published: (2016)
A performance improvement of Dömösi’s cryptosystem
by: Khaleel, Ghassan, et al.
Published: (2016)
by: Khaleel, Ghassan, et al.
Published: (2016)
A comparative performance analysis of modified Dӧmӧsi’s cryptosystem and data encryption standard
by: Khaleel, Ghassan, et al.
Published: (2017)
by: Khaleel, Ghassan, et al.
Published: (2017)
A performance improvement of Domosi’s cryptosystem
by: Khaleel, Ghassan, et al.
Published: (2015)
by: Khaleel, Ghassan, et al.
Published: (2015)
A new block cipher based on finite automata systems
by: Khaleel, Ghassan, et al.
Published: (2016)
by: Khaleel, Ghassan, et al.
Published: (2016)
Performance and security improvements of Dӧmӧsi’s cryptosystem
by: Khaleel, Ghassan, et al.
Published: (2016)
by: Khaleel, Ghassan, et al.
Published: (2016)
A symmetric cryptosystem based on nondeterministic finite automata
by: Khaleel, Ghassan, et al.
Published: (2017)
by: Khaleel, Ghassan, et al.
Published: (2017)
Multiset controlled grammars: A normal form and closure properties
by: Ashaari, Salbiah, et al.
Published: (2017)
by: Ashaari, Salbiah, et al.
Published: (2017)
Tree valence controlled grammars
by: Ashaari, Salbiah, et al.
Published: (2017)
by: Ashaari, Salbiah, et al.
Published: (2017)
Some properties of the concurrent grammars
by: Mavlankulov, Gairatzhan, et al.
Published: (2014)
by: Mavlankulov, Gairatzhan, et al.
Published: (2014)
Concurrently controlled grammars
by: Mavlankulov, Gairatzhan, et al.
Published: (2018)
by: Mavlankulov, Gairatzhan, et al.
Published: (2018)
Parsing algorithms for grammars with regulated rewriting
by: Turaev, Sherzod, et al.
Published: (2011)
by: Turaev, Sherzod, et al.
Published: (2011)
Grammars controlled by Petri Nets
by: Dassow, Juergen, et al.
Published: (2012)
by: Dassow, Juergen, et al.
Published: (2012)
A new variant of Petri net controlled grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015)
by: Mohamad Jan, Nurhidaya, et al.
Published: (2015)
Language classes generated by tree controlled grammars with bounded nonterminal complexity
by: Turaev, Sherzod, et al.
Published: (2012)
by: Turaev, Sherzod, et al.
Published: (2012)
Place-Labeled Petri Net Controlled Grammars
by: Mohamad Jan, Nurhidaya, et al.
Published: (2016)
by: Mohamad Jan, Nurhidaya, et al.
Published: (2016)
Similar Items
-
Watson-Crick linear grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2015) -
Watson-Crick Linear Grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2019) -
Watson–Crick context-free grammars: Grammar simplifications and a parsing algorithm
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2018) -
Closure properties of Watson-Crick grammars
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2015) -
The computational power of Watson-Crick grammars: Revisited
by: Mohamad Zulkufli, Nurul Liyana, et al.
Published: (2016)