5′ → 3′ Watson-Crick AutomataWith Several Runs
From MaRDI portal
Publication:3000291
DOI10.3233/FI-2010-336zbMATH Open1215.68121MaRDI QIDQ3000291FDOQ3000291
Authors: Peter Leupold, Benedek Nagy 
Publication date: 18 May 2011
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Recommendations
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
- On 5′→3′ Sensing Watson-Crick Finite Automata
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- scientific article; zbMATH DE number 1342112
- On string reading stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata (extended abstract)
- scientific article; zbMATH DE number 2104767
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (19)
- Title not available (Why is that?)
- 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?)
- Hierarchies of stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata languages
- On string reading stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata (extended abstract)
- Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
- On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
- Reversible Two-Party Computations
- Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
- Watson-Crick pushdown automata.
- Quasi-deterministic \(5^\prime \rightarrow 3^\prime\) Watson-Crick automata
- Linear automata with translucent letters and linear context-free trace languages
- On deterministic 1-limited \(5' \rightarrow 3'\) sensing Watson-Crick finite-state transducers
- Unary Watson-Crick automata
- On language classes accepted by stateless 5′ → 3′ Watson-Crick finite automata
This page was built for publication: 5′ → 3′ Watson-Crick AutomataWith Several Runs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000291)
