Fong, Wan Heng and Mohamad Jan, Nurhidaya and Sarmin, Nor Haniza and Turaev, Sherzod (2013) Watson-Crick Petri net languages: the effect of labeling strategies. In: 21st National Symposium on Mathematical Sciences: Germination of Mathematical Sciences Education and Research Towards Global Sustainability, SKSM 21, 6-8 Nov, 2013, Penang, Malaysia.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1063/1.4887673
Abstract
A Watson-Crick automaton is an automaton that works on tapes which are double stranded sequences of symbols related by Watson-Crick complementarity that are similar to the DNA molecules. However, this automaton cannot exploit the other fundamental features of DNA molecules such as the massive parallelism. Watson-Crick automata can be related to a model known as the Petri net. Petri net is a model based on the concepts of asynchronous and concurrent operation by the parts of a system and the realization by the parts can be represented by a graph or a net. From the relation between Watson-Crick automata and Petri net, a new model namely Watson-Crick Petri net has been developed. The language generated by Watson-Crick Petri net is a set of labeled sequences corresponding to the occurrence sequences of the model. In this research, some properties of languages generated by Watson-Crick Petri net are investigated.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | automata, language |
| Subjects: | Q Science > Q Science (General) |
| Divisions: | Science |
| ID Code: | 67164 |
| Deposited By: | Siti Nor Hashidah Zakaria |
| Deposited On: | 18 Jun 2017 08:39 |
| Last Modified: | 18 Jun 2017 08:39 |
Repository Staff Only: item control page
