On determinism versus nondeterminism for restarting automata

DOI10.1016/j.ic.2008.03.021zbMath1328.68114OpenAlexW2036965567MaRDI QIDQ948093

Hartmut Messerschmidt, Friedrich Otto

Publication date: 8 October 2008

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.021

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of 2-monotone restarting automata
• Growing context-sensitive languages and Church-Rosser languages
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Recent advances in formal languages and applications.
• Restarting automata
• A general theory of translation
• Developments in Language Theory
• Correctness Preservation and Complexity of Simple RL-Automata

This page was built for publication: On determinism versus nondeterminism for restarting automata