On CD-Systems of Stateless Deterministic Two-Phase RR(1)-Automata
From MaRDI portal
Publication:3166947
DOI10.1007/978-3-642-31644-9_8zbMath1367.68170OpenAlexW47104293MaRDI QIDQ3166947
Publication date: 1 November 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_8
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On stateless deterministic restarting automata
- On stateless multihead automata: hierarchies and the emptiness problem
- Succinct description of regular languages by weak restarting automata
- Globally Deterministic CD-Systems of Stateless R(1)-Automata
- ON STATELESS TWO-PUSHDOWN AUTOMATA AND RESTARTING AUTOMATA
- COOPERATING DISTRIBUTED SYSTEMS OF RESTARTING AUTOMATA
- CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages
- Church-Rosser Thue systems and formal languages
- Strictly Deterministic CD-Systems of Restarting Automata
- A variant of a recursively unsolvable problem