Reversible Watson-Crick automata

DOI10.1007/s00236-016-0267-0zbMath1378.68102arXiv1507.05283OpenAlexW2295356085MaRDI QIDQ2406432

Kingshuk Chatterjee, Kumar Sankar Ray

Publication date: 29 September 2017

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.05283

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Reversible Two-Party Computations ⋮ Watson-Crick quantum finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversible pushdown automata
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
• On the descriptional complexity of Watson-Crick automata
• Two-Way Reversible Multi-Head Finite Automata
• One-Way Reversible Multi-head Finite Automata
• k + 1 Heads Are Better than k
• Logical Reversibility of Computation
• Developments in Language Theory

This page was built for publication: Reversible Watson-Crick automata