\(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
From MaRDI portal
Publication:6177182
DOI10.1007/s11047-021-09869-9zbMath1530.68152OpenAlexW3196052876MaRDI QIDQ6177182
Benedek Nagy, Shaghayegh Parchami
Publication date: 31 August 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-021-09869-9
finite automataclosure propertieshierarchylinear context-free languagesWatson-Crick automata\(5'\rightarrow 3'\) WK automatasublinear languages
Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (2)
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
- Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
- DNA computing. New computing paradigms.
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
- On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
- A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
- Linear automata with translucent letters and linear context-free trace languages
- Linear Context Free Languages
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On a family of linear grammars
- A machine realization of the linear context-free languages
- Developments in Language Theory
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
This page was built for publication: \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
