Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
From MaRDI portal
Publication:3518271
DOI10.2168/LMCS-4(1:5)2008zbMath1158.68022OpenAlexW3104076899MaRDI QIDQ3518271
Publication date: 7 August 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-4(1:5)2008
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Unnamed Item, 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, Unnamed Item, Unnamed Item, A tighter analysis of Piterman's Büchi determinization, Tighter Bounds for the Determinisation of Büchi Automata, State of Büchi Complementation, The complexity of weakly recognizing morphisms, Operations on Weakly Recognizing Morphisms, Rabin vs. Streett Automata
