State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata

DOI10.1007/S11047-015-9494-5zbMath1415.68137OpenAlexW2162955980MaRDI QIDQ2003500

Kingshuk Chatterjee, Debayan Ganguly, Kumar Sankar Ray

Publication date: 8 July 2019

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-015-9494-5

zbMATH Keywords

state complexitynondeterministic Watson-Crick automatadeterministic Watson-Crick automatatime-varying Watson-Crick automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

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 ⋮ Unnamed Item

Cites Work

• The state complexities of some basic operations on regular languages
• On the descriptional complexity of Watson-Crick automata
• On the power of parallel communicating Watson-Crick automata systems
• Time varying finite automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata