Büchi Complementation Made Tight
From MaRDI portal
Publication:5390016
DOI10.4230/LIPIcs.STACS.2009.1854zbMath1236.68176MaRDI QIDQ5390016
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_7d1b.html
automata theory; automata and formal languages; Büchi complementation; nondeterministic Büchi automata
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
Unnamed Item, Unnamed Item, Rabin vs. Streett Automata, On the power of finite ambiguity in Büchi complementation, Towards a grand unification of Büchi complementation constructions, On the translation of automata to linear temporal logic, Bounded model checking of ETL cooperating with finite and looping automata connectives, Profile trees for Büchi word automata, with application to determinization, A tighter analysis of Piterman's Büchi determinization, Parametric random generation of deterministic tree automata, \( \omega \)-automata, Certifying inexpressibility, Büchi Store: An Open Repository of Büchi Automata, State of Büchi Complementation, Automata Theory and Model Checking, The mu-calculus and Model Checking, Random Generation of Deterministic Tree (Walking) Automata