Globally Deterministic CD-Systems of Stateless R(1)-Automata
From MaRDI portal
Publication:3004599
DOI10.1007/978-3-642-21254-3_31zbMath1330.68170OpenAlexW202298967MaRDI QIDQ3004599
Publication date: 3 June 2011
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_31
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (8)
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata ⋮ Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ State-deterministic \(5'\rightarrow 3'\) Watson-Crick automata ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ A survey on automata with translucent letters ⋮ State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters ⋮ Unnamed Item ⋮ On Restarting Automata with Window Size One
This page was built for publication: Globally Deterministic CD-Systems of Stateless R(1)-Automata