On determinism versus nondeterminism for restarting automata
From MaRDI portal
(Redirected from Publication:948093)
Recommendations
Cites work
- scientific article; zbMATH DE number 3839323 (Why is no real title available?)
- scientific article; zbMATH DE number 3612465 (Why is no real title available?)
- scientific article; zbMATH DE number 2040896 (Why is no real title available?)
- scientific article; zbMATH DE number 2080930 (Why is no real title available?)
- scientific article; zbMATH DE number 2245557 (Why is no real title available?)
- A general theory of translation
- Correctness Preservation and Complexity of Simple RL-Automata
- Developments in Language Theory
- Growing context-sensitive languages and Church-Rosser languages
- On the complexity of 2-monotone restarting automata
- Recent advances in formal languages and applications.
- Restarting automata
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
Cited in
(5)- Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
- On special forms of restarting automata
- scientific article; zbMATH DE number 2040896 (Why is no real title available?)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
This page was built for publication: On determinism versus nondeterminism for restarting automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948093)