The following pages link to The Büchi Complementation Saga (Q3590920):
Displaying 20 items.
- A practical decision procedure for propositional projection temporal logic with infinite models (Q744099) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- When is scalar multiplication decidable? (Q2311210) (← links)
- Uncountable automatic classes and learning (Q2431428) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Automata-Based Termination Proofs (Q3637353) (← links)
- On-the-fly Emptiness Check of Transition-Based Streett Automata (Q3648699) (← links)
- Uncountable Automatic Classes and Learning (Q3648759) (← links)
- A Generalization of Semenov’s Theorem to Automata over Real Numbers (Q5191120) (← links)
- Random Models for Evaluating Efficient Büchi Universality Checking (Q5224494) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- Model Checking Quantitative Linear Time Logic (Q5415664) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- (Q5743484) (← links)
- Simulations in rank-based Büchi automata complementation (Q6536321) (← links)
