On the Succinctness of Nondeterminism

DOI10.1007/11901914_12zbMATH Open1161.68508OpenAlexW1551895525MaRDI QIDQ3522904FDOQ3522904

Authors: Benjamin Aminof, Orna Kupferman 

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_12

Recommendations

• On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
• Co-Büching them all
• The quest for a tight translation of Büchi to co-Büchi automata
• On the (in)succinctness of Muller automata
• Translating to co-Büchi made tight, unified, and useful

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cited In (7)

• On Repetition Languages
• On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
• On the (in)succinctness of Muller automata
• Towards separating nondeterminism from determinism
• Title not available (Why is that?)
• Nondeterminism through well-founded choice
• Title not available (Why is that?)

This page was built for publication: On the Succinctness of Nondeterminism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522904)