On 5′→3′ Sensing Watson-Crick Finite Automata

DOI10.1007/978-3-540-77962-9_27zbMath1137.68401OpenAlexW2112278316MaRDI QIDQ5452699

Benedek Nagy

Publication date: 4 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-77962-9_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

\( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ Unnamed Item ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ Reversible Two-Party Computations ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ The Viterbi algorithm for subsets of stochastic context-free languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Binding-blocking automata ⋮ 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 ⋮ Two-Party Watson-Crick Computations ⋮ On double-jumping finite automata and their closure properties ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

Cites Work

• On a family of linear grammars
• Generalizations of regular events
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item