The following pages link to (Q4726235):
Displayed 25 items.
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- On mathematical contributions of Paul E. Schupp (Q716386) (← links)
- Hierarchies of weak automata and weak monadic formulas (Q805253) (← links)
- Alternating automata with start formulas (Q915487) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
- On automata on infinite trees (Q1186604) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- The Borel hierarchy is infinite in the class of regular sets of trees (Q1210306) (← links)
- Synchronized tree automata (Q1325832) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Extending Co-logic Programs for Branching-Time Model Checking (Q3453651) (← links)
- Yield-languages recognized by alternating tree recognizers (Q3804222) (← links)
- Fairness and regularity for SCCS processes (Q3816967) (← links)
- On Distributive Fixed-Point Expressions (Q4943552) (← links)
- On Repetition Languages (Q5089230) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- Index Problems for Game Automata (Q5278187) (← links)
- From LTL to Symbolically Represented Deterministic Automata (Q5452723) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- (Q5875379) (← links)
- A space-efficient on-the-fly algorithm for real-time model checking (Q6162102) (← links)