Hierarchies of stateless multicounter 5^ 3^ Watson-Crick automata languages

DOI10.3233/FI-2011-531MaRDI QIDQ3100929zbMATH OpenOpenAlexFDO

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

Publication date 22 November 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2011-531

zbMATH Keywords

formal language recognitionhierarchiesmulticounter stateless automatatwo-head automataWatson-Crick automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Stateless multicounter 5' 3' Watson-Crick automata: the deterministic case
• On string reading stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata (extended abstract)
• On stateless multicounter machines
• 5′ → 3′ Watson-Crick AutomataWith Several Runs
• Hierarchies and Characterizations of Stateless Multicounter Machines

Cited in

(6)

• Stateless multicounter 5' 3' Watson-Crick automata: the deterministic case
• \( 5^\prime \to 3^\prime\) Watson-Crick pushdown automata
• A survey of results on stateless multicounter automata
• On stateless multicounter machines
• On string reading stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata (extended abstract)
• Hierarchies and Characterizations of Stateless Multicounter Machines

This page was built for publication: Hierarchies of stateless multicounter \(5^{\prime} \rightarrow 3^{\prime}\) Watson-Crick automata languages

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