On determinism versus nondeterminism for restarting automata

DOI10.1016/J.IC.2008.03.021zbMATH Open1328.68114OpenAlexW2036965567MaRDI QIDQ948093FDOQ948093

Authors: 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

Recommendations

• Hierarchical Relaxations of the Correctness Preserving Property for Restarting Automata
• Restarting automata
• ON DETERMINISTIC CD-SYSTEMS OF RESTARTING AUTOMATA
• On Nonforgetting Restarting Automata That Are Deterministic and/or Monotone
• On the effects of nondeterminism on ordered restarting automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Growing context-sensitive languages and Church-Rosser languages
• Restarting automata
• Recent advances in formal languages and applications.
• A general theory of translation
• The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Developments in Language Theory
• Title not available (Why is that?)
• On the complexity of 2-monotone restarting automata
• Correctness Preservation and Complexity of Simple RL-Automata

Cited In (5)

• On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
• On special forms of restarting automata
• Title not available (Why is that?)
• On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata
• Hierarchical Relaxations of the Correctness Preserving Property for 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)