Büchi Complementation Made Tight

DOI10.4230/LIPIcs.STACS.2009.1854zbMath1236.68176OpenAlexW2963378790MaRDI QIDQ5390016

Sven Schewe

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_7d1b.html

zbMATH Keywords

automata theoryautomata and formal languagesBüchi complementationnondeterministic Büchi automata

Mathematics Subject Classification ID

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

Related Items (17)

Automata Theory and Model Checking ⋮ The mu-calculus and Model Checking ⋮ Bounded model checking of ETL cooperating with finite and looping automata connectives ⋮ On the power of finite ambiguity in Büchi complementation ⋮ Towards a grand unification of Büchi complementation constructions ⋮ Profile trees for Büchi word automata, with application to determinization ⋮ On the translation of automata to linear temporal logic ⋮ Parametric random generation of deterministic tree automata ⋮ Unnamed Item ⋮ Büchi Store: An Open Repository of Büchi Automata ⋮ Certifying inexpressibility ⋮ A tighter analysis of Piterman's Büchi determinization ⋮ State of Büchi Complementation ⋮ Random Generation of Deterministic Tree (Walking) Automata ⋮ Unnamed Item ⋮ \( \omega \)-automata ⋮ Rabin vs. Streett Automata

This page was built for publication: Büchi Complementation Made Tight