The Quest for a Tight Translation of Büchi to co-Büchi Automata

DOI10.1007/978-3-642-15025-8_8zbMath1287.68092OpenAlexW1512592750MaRDI QIDQ3586001

Orna Kupferman, Udi Boker

Publication date: 3 September 2010

Published in: Fields of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_8

zbMATH Keywords

nondeterminismBüchi automataco-Büchi automataautomata translation

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ On the translation of automata to linear temporal logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alternating finite automata on \(\omega\)-words
• Automata-theoretic techniques for modal logics of programs
• Reasoning about infinite computations
• Translating to Co-Büchi Made Tight, Unified, and Useful
• Alternation Removal in Büchi Automata
• Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique
• Tightening the Exchange Rates Between Automata
• From linear time to branching time
• On Locally Checkable Properties
• From LTL to Symbolically Represented Deterministic Automata
• TYPENESS FOR ω-REGULAR AUTOMATA
• On the Relative Succinctness of Nondeterministic Büchi and co-Büchi Word Automata
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: The Quest for a Tight Translation of Büchi to co-Büchi Automata