On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
From MaRDI portal
Publication:2844002
DOI10.1093/logcom/exr049zbMath1284.68362OpenAlexW1980331856MaRDI QIDQ2844002
Publication date: 27 August 2013
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exr049
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (19)
Contextual array grammars with matrix control, regular control languages, and tissue P systems control ⋮ \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ Non-isometric Contextual Array Grammars with Regular Control and Local Selectors ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Simple picture processing based on finite automata and regular grammars ⋮ On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN ⋮ On double-jumping finite automata and their closure properties ⋮ Contextual Array Grammars with Matrix and Regular Control ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers ⋮ On restarting automata with auxiliary symbols and small window size
This page was built for publication: On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
