CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
From MaRDI portal
Publication:3564886
DOI10.1007/978-3-642-13089-2_39zbMath1284.68363OpenAlexW1519994701MaRDI QIDQ3564886
Publication date: 26 May 2010
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-13089-2_39
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (13)
On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata ⋮ Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata ⋮ Non-returning deterministic and nondeterministic finite automata with translucent letters ⋮ Jump complexity of 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 ⋮ On CD-systems of stateless deterministic R-automata with window size one ⋮ Unnamed Item ⋮ Linear automata with translucent letters and linear context-free trace languages ⋮ Binding-blocking automata ⋮ On Restarting Automata with Window Size One ⋮ An Automata-Theoretical Characterization of Context-Free Trace Languages ⋮ CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
This page was built for publication: CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages