On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN

DOI10.1007/S00236-019-00362-6zbMath1487.68152OpenAlexW3000307249MaRDI QIDQ2035005

Benedek Nagy, Shaghayegh Parchami

Publication date: 23 June 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-019-00362-6

Mathematics Subject Classification ID

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

Related Items (7)

A jumping \(5'\rightarrow 3'\) Watson-Crick finite automata model ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ On bidirectional deterministic finite automata ⋮ On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case
• DNA computing. New computing paradigms.
• Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter
• Two-head finite-state acceptors with translucent letters
• On a hierarchy of 5' -> 3' sensing Watson-Crick finite automata languages
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Linear automata with translucent letters and linear context-free trace languages
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On a family of linear grammars
• Developments in Language Theory

This page was built for publication: On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN