On deterministic sensing 5' 3' Watson-Crick finite automata: a full hierarchy in 2detLIN
From MaRDI portal
(Redirected from Publication:2035005)
On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
Recommendations
- Deterministic sensing 5' 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
Cites work
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
- Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
- Developments in Language Theory
- DNA computing. New computing paradigms.
- scientific article; zbMATH DE number 1670714 (Why is no real title available?)
- scientific article; zbMATH DE number 5605080 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2019607 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 7444011 (Why is no real title available?)
- Linear automata with translucent letters and linear context-free trace languages
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On a family of linear grammars
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- On two-sided locally testable languages
- Stateless multicounter 5' 3' Watson-Crick automata: the deterministic case
- Two-head finite-state acceptors with translucent letters
Cited in
(16)- Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- scientific article; zbMATH DE number 7444011 (Why is no real title available?)
- On deterministic 1-limited 5' 3' sensing Watson-Crick finite-state transducers
- On 5′→3′ Sensing Watson-Crick Finite Automata
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
- 5' 3' Watson-Crick automata languages-without sensing parameter
- Quasi-deterministic 5^ 3^ Watson-Crick automata
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
- On bidirectional deterministic finite automata
- Quasi-deterministic finite one-head and two-head automata
- An active learning algorithm for bidirectional deterministic finite automata
- 5^ 3^ Watson-Crick automata accepting necklaces
- On languages of transduced-input finite automata with translucent letters
- A two-dimensional infinite hierarchy for finite automata with translucent words
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)
