On deterministic sensing 5' 3' Watson-Crick finite automata: a full hierarchy in 2detLIN
From MaRDI portal
Publication:2035005
DOI10.1007/S00236-019-00362-6zbMATH Open1487.68152OpenAlexW3000307249MaRDI QIDQ2035005FDOQ2035005
Authors: Benedek Nagy, Shaghayegh Parchami
Publication date: 23 June 2021
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-019-00362-6
Recommendations
- Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
- scientific article; zbMATH DE number 7444011
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- On 5′→3′ Sensing Watson-Crick Finite Automata
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
- On a family of linear grammars
- DNA computing. New computing paradigms.
- Title not available (Why is that?)
- Developments in Language Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
- Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
- Title not available (Why is that?)
- 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?)
Cited In (10)
- Title not available (Why is that?)
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
- Title not available (Why is that?)
- On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
- On 5′→3′ Sensing Watson-Crick Finite Automata
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- On bidirectional deterministic finite automata
This page was built for publication: On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035005)