On a hierarchy of 5^ 3^ sensing Watson-Crick finite automata languages

DOI10.1093/LOGCOM/EXR049MaRDI QIDQ2844002zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

2-head automataDNA computerformal languageshierarchylinear languagesWatson-Crick automata

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Formal languages and automata (68Q45)

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' 3' Watson-Crick automata without sensing parameter
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• scientific article; zbMATH DE number 7444011

Cited in

(26)

• Simple picture processing based on finite automata and regular grammars
• Deterministic sensing 5' 3' Watson-Crick automata without sensing parameter
• On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN
• Contextual array grammars with matrix control, regular control languages, and tissue P systems control
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
• A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model
• Contextual array grammars with matrix and regular control
• Non-isometric contextual array grammars with regular control and local selectors
• Linear automata with translucent letters and linear context-free trace languages
• On two-sided locally testable 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 restarting automata with auxiliary symbols and small window size
• On double-jumping finite automata and their closure properties
• On 5′→3′ Sensing Watson-Crick Finite Automata
• Watson-Crick jumping 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
• A survey on automata with translucent letters
• Reversible Two-Party Computations
• 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

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)