On string reading stateless multicounter 5^ 3^ Watson-Crick automata (extended abstract)

DOI10.1007/978-3-642-39074-6_29zbMATH Open1334.68073OpenAlexW2149368997MaRDI QIDQ5300929FDOQ5300929

Authors: László Hegedüs, Benedek Nagy 

Publication date: 28 June 2013

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39074-6_29

Recommendations

• Hierarchies of stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata languages
• Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
• scientific article; zbMATH DE number 7444011
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited In (4)

• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Hierarchies of stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata languages
• Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata

This page was built for publication: On string reading stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300929)