Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter

DOI10.1007/978-3-319-92435-9_13OpenAlexW2806344475MaRDI QIDQ1799374

Benedek Nagy, Shaghayegh Parchami

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-92435-9_13

zbMATH Keywords

finite automatahierarchydeterministic languageslinear context-free languages\(5'\rightarrow 3'\) WK automatadeterministic Watson-Crick automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (8)

\( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

This page was built for publication: Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter