The Büchi Complementation Saga
From MaRDI portal
Publication:3590920
DOI10.1007/978-3-540-70918-3_2zbMath1186.03062OpenAlexW1506225460MaRDI QIDQ3590920
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.6917
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata, The mu-calculus and Model Checking, Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition, Towards a grand unification of Büchi complementation constructions, Universal first-order quantification over automata, Uncountable automatic classes and learning, On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases, Model Checking Quantitative Linear Time Logic, A Generalization of Semenov’s Theorem to Automata over Real Numbers, From Philosophical to Industrial Logics, From Monadic Logic to PSL, State of Büchi Complementation, A practical decision procedure for propositional projection temporal logic with infinite models, Automata-Based Termination Proofs, Random Models for Evaluating Efficient Büchi Universality Checking, When is scalar multiplication decidable?, On-the-fly Emptiness Check of Transition-Based Streett Automata, Uncountable Automatic Classes and Learning, \( \omega \)-automata, Unnamed Item