Co-Büching them all

DOI10.1007/978-3-642-19805-2_13MaRDI QIDQ3000608zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(9)

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