On a hierarchy of 5^ 3^ sensing Watson-Crick finite automata languages
DOI10.1093/LOGCOM/EXR049zbMATH Open1284.68362OpenAlexW1980331856MaRDI QIDQ2844002FDOQ2844002
Authors: Benedek Nagy 
Publication date: 27 August 2013
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/exr049
Recommendations
- On 5′→3′ Sensing Watson-Crick Finite Automata
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
- Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
- 5′ → 3′ Watson-Crick AutomataWith Several Runs
- scientific article; zbMATH DE number 7444011
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (23)
- Title not available (Why is that?)
- Simple picture processing based on finite automata and regular grammars
- Non-isometric contextual array grammars with regular control and local selectors
- State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata
- \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter
- Contextual array grammars with matrix control, regular control languages, and tissue P systems control
- On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
- A survey on automata with translucent letters
- Contextual array grammars with matrix and regular control
- On restarting automata with auxiliary symbols and small window size
- \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
- Reversible Two-Party Computations
- State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters
- Watson-Crick jumping finite automata
- On 5′→3′ Sensing Watson-Crick Finite Automata
- Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
- A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
- Quasi-deterministic \(5^\prime \rightarrow 3^\prime\) Watson-Crick automata
- Linear automata with translucent letters and linear context-free trace languages
- On bidirectional deterministic finite automata
- On two-sided locally testable languages
- On deterministic 1-limited \(5' \rightarrow 3'\) sensing Watson-Crick finite-state transducers
- On double-jumping finite automata and their closure properties
This page was built for publication: On a hierarchy of \(5^{\prime}\rightarrow 3^{\prime}\) sensing Watson-Crick finite automata languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2844002)
