Proceedings ArticleDOI
Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton
Mary Jemima Samuel,V.R. Daret +1 more
- pp 1322-1330
TLDR
Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity is defined.Abstract:
Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. Some computational power of this automaton is dealt with. Also we define timed Watson-Crick ω-automaton and some equivalence results have been established.read more
Citations
More filters
Book
Journal of Automata, Languages and Combinatorics, Vol. 11(1)
TL;DR: Special Issue: Selected papers of the International Workshop on Security Analysis of Systems: Formalisms and Tools (Orleans, France, June 21–22, 2004)
References
More filters
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Book ChapterDOI
Languages, automata, and logic
TL;DR: The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.
Journal ArticleDOI
Some properties of two-dimensional on-line tessellation acceptors
Katsushi Inoue,Akira Nakamura +1 more
TL;DR: The purpose of this paper is to propose a new type acceptor called the “two-dimensional on-line tessellation acceptor” (denoted by “2-ota”) and to examine several properties of the 2-ota, which might be considered as a real-time mode of rectangular array bounded cellular space.
Book ChapterDOI
State and Transition Complexity of Watson-Crick Finite Automata
Andrei Păun,Mihaela Paun +1 more
TL;DR: The succinctness of recognizing regular languages by Watson-Crick (arbitrary or 1-limited) automata in comparison with non-deterministic finite automata is investigated, as well as decidability and computability questions.