Stateless multicounter \(5'\to 3'\) Watson-Crick automata: the deterministic case

DOI10.1007/s11047-011-9290-9zbMath1251.68111OpenAlexW2018485384MaRDI QIDQ1761728

Ömer Eğecioğlu, László Hegedüs, Benedek Nagy

Publication date: 15 November 2012

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-011-9290-9

zbMATH Keywords

universalityDNA computingmembrane computingcounter machinereversal bounded machinestateless machineWatson-Crick automata

Mathematics Subject Classification ID

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

Related Items

A novel text and image encryption method based on chaos theory and DNA computing ⋮ \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ \(5'\rightarrow 3'\) Watson-Crick automata languages-without sensing parameter ⋮ Unnamed Item ⋮ On deterministic sensing \(5'\rightarrow 3'\) Watson-Crick finite automata: a full hierarchy in 2detLIN

Cites Work

• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
• On Stateless Multicounter Machines
• Hierarchies and Characterizations of Stateless Multicounter Machines
• On 5′→3′ Sensing Watson-Crick Finite Automata
• On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item