5′ → 3′ Watson-Crick AutomataWith Several Runs
From MaRDI portal
Publication:3000291
DOI10.3233/FI-2010-336zbMath1215.68121MaRDI QIDQ3000291
Publication date: 18 May 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (10)
\( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Reversible Two-Party Computations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case ⋮ On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
This page was built for publication: 5′ → 3′ Watson-Crick AutomataWith Several Runs
