State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata

DOI10.1007/s11047-021-09865-zzbMath1530.68151OpenAlexW3186937276MaRDI QIDQ6095517

Benedek Nagy

Publication date: 8 September 2023

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

Full work available at URL: https://doi.org/10.1007/s11047-021-09865-z

zbMATH Keywords

determinismfinite automatahierarchylinear context-free languagesWatson-Crick automata\(5'\rightarrow 3'\) WK automatasublinear languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (3)

\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
• State complexity of deterministic Watson-Crick automata and time varying Watson-Crick automata
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• Two-head finite-state acceptors with translucent letters
• On the descriptional complexity of Watson-Crick automata
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• Globally deterministic CD-systems of stateless R-automata with window size 1
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Globally Deterministic CD-Systems of Stateless R(1)-Automata
• Linear automata with translucent letters and linear context-free trace languages
• An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
• On 5′→3′ Sensing Watson-Crick Finite Automata
• Developments in Language Theory
• Watson-Crick palindromes in DNA computing

This page was built for publication: State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata