Handbook of theoretical computer science (vol. B)
Handbook of formal languages, vol. 1
Handbook of formal languages, vol. 3
Languages, automata, and logic
Handbook of formal languages, vol. 3
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Lindenmayer and DNA: Watson-Crick D0L systems
Current trends in theoretical computer science
Uni-transitional Watson-Crick DOL systems
Theoretical Computer Science
On the power of parallel communicating Watson-Crick automata systems
Theoretical Computer Science
Parallel communicating Watson-Crick automata systems
Acta Cybernetica
On the descriptional complexity of Watson-Crick automata
Theoretical Computer Science
On 5' → 3' sensing Watson-Crick finite automata
DNA13'07 Proceedings of the 13th international conference on DNA computing
The role of the complementarity relation in watson-crick automata and sticker systems
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Watson-Crick ω-automata are finite automata working with infinite double-stranded words, where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. There are several natural possibilities to define such automata, in particular to define the acceptance condition for such infinit double-stranded words. We present here several results on the equivalence of Büchi, Rabin, Streett, and Muller-like acceptance conditions. We prove that these acceptance conditions are equivalent for nondeterministic Watson-Crick ω-automata. For deterministic automata, we prove that the four conditions are equivalent for nonempty stateless automata, while the general case remains open. We also investigate the relationship between the classes of languages accepted by several types of Watson-Crick ω-automata.