Co-Büching them all

DOI10.1007/978-3-642-19805-2_13zbMATH Open1326.68174OpenAlexW2009929770MaRDI QIDQ3000608FDOQ3000608

Authors: Udi Boker, Orna Kupferman 

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_13

Recommendations

• Translating to co-Büchi made tight, unified, and useful
• The quest for a tight translation of Büchi to co-Büchi automata
• On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
• TYPENESS FOR ω-REGULAR AUTOMATA
• Automated Technology for Verification and Analysis

Mathematics Subject Classification ID

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

Cited In (9)

• On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
• From Spot 2.0 to Spot 2.10: What’s New?
• Congruence Relations for Büchi Automata
• The quest for a tight translation of Büchi to co-Büchi automata
• Automated Technology for Verification and Analysis
• Rabin vs. Streett automata
• Translating to co-Büchi made tight, unified, and useful
• On the Succinctness of Nondeterminism
• TYPENESS FOR ω-REGULAR AUTOMATA

This page was built for publication: Co-Büching them all

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