A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
From MaRDI portal
Publication:2675809
DOI10.1007/s00236-021-00413-xOpenAlexW4207035249MaRDI QIDQ2675809
Alexander Meduna, Benedek Nagy, Radim Kocman, Zbyněk Křivka
Publication date: 26 September 2022
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-021-00413-x
Related Items (4)
Reversible Two-Party Computations ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ On double-jumping finite automata and their closure properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidability of right one-way jumping finite automata
- Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
- Two-head finite-state acceptors with translucent letters
- Enhancement of automata with jumping modes
- Watson-Crick jumping finite automata
- Characterization and complexity results on jumping finite automata
- Operational state complexity and decidability of jumping finite automata
- On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
- Jumping Finite Automata: Characterizations and Complexity
- Linear automata with translucent letters and linear context-free trace languages
- Jumping Grammars
- Jumping Scattered Context Grammars
- Modern Language Models and Computation
- On Basic Properties of Jumping Finite Automata
- JUMPING FINITE AUTOMATA
- On double-jumping finite automata and their closure properties
- Regulated Grammars and Automata
- On 5′→3′ Sensing Watson-Crick Finite Automata
- Developments in Language Theory
- One-Way Jumping Finite Automata
This page was built for publication: A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
