A jumping 5' 3' Watson-Crick finite automata model
From MaRDI portal
Publication:2675809
DOI10.1007/S00236-021-00413-XOpenAlexW4207035249MaRDI QIDQ2675809FDOQ2675809
Authors: Radim Kocman, Zbyněk Křivka, Alexander Meduna, Benedek Nagy 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regulated grammars and automata
- Scattered context grammars and their applications.
- Developments in Language Theory
- Decidability of right one-way jumping finite automata
- Characterization and complexity results on jumping finite automata
- Jumping finite automata
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- 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
- Linear automata with translucent letters and linear context-free trace languages
- Title not available (Why is that?)
- Operational state complexity and decidability of jumping finite automata
- Jumping finite automata: characterizations and complexity
- On basic properties of jumping finite automata
- One-way jumping finite automata
- Enhancement of automata with jumping modes
- Jumping grammars
- Watson-Crick jumping finite automata
- On double-jumping finite automata and their closure properties
- Jumping scattered context grammars
- Modern Language Models and Computation
Cited In (6)
- Title not available (Why is that?)
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
- Reversible Two-Party Computations
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
- Quasi-deterministic \(5^\prime \rightarrow 3^\prime\) Watson-Crick automata
- On double-jumping finite automata and their closure properties
This page was built for publication: A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2675809)
