On the descriptional complexity of Watson-Crick automata

DOI10.1016/j.tcs.2009.05.001zbMath1180.68169OpenAlexW2079582928MaRDI QIDQ2271460

Eugen Czeizler, Elena Czeizler, Lila Kari, Kai Salomaa

Publication date: 7 August 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.001

zbMATH Keywords

determinismstate complexityWatson-Crick automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

Reversible Watson-Crick automata ⋮ Non-regular unary language and parallel communicating Watson-Crick automata systems ⋮ Unary Watson-Crick automata ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ Nonterminal complexity of one-sided random context grammars ⋮ Reversible Two-Party Computations ⋮ Unnamed Item ⋮ State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata ⋮ Watson-Crick quantum finite automata ⋮ Operational Accepting State Complexity: The Unary and Finite Case ⋮ Two-Party Watson-Crick Computations ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

Cites Work

• On partially blind multihead finite automata.
• On Multi-Head Finite Automata
• Developments in Language Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the descriptional complexity of Watson-Crick automata