On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata
From MaRDI portal
Publication:5300929
DOI10.1007/978-3-642-39074-6_29zbMath1334.68073OpenAlexW2149368997MaRDI QIDQ5300929
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
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (1)
This page was built for publication: On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata