The following pages link to (Q3086936):
Displaying 30 items.
- Automata and logics over finitely varying functions (Q636272) (← links)
- Counting branches in trees using games (Q729823) (← links)
- Relativizations for the logic-automata connection (Q815004) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- A formal theory of simulations between infinite automata (Q1309253) (← links)
- Model theory of monadic predicate logic with the infinity quantifier (Q2144617) (← links)
- Abstract interpretation as automated deduction (Q2360874) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- Randomization in Automata on Infinite Trees (Q2946733) (← links)
- State of Büchi Complementation (Q3073645) (← links)
- Automatentheorie und Logik (Q3083622) (← links)
- On the Relationship between -automata and Temporal Logic Normal Forms (Q3146301) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Abstract Interpretation as Automated Deduction (Q3454115) (← links)
- Automata vs. Logics on Data Words (Q3586037) (← links)
- (Q3998008) (← links)
- (Q4931900) (← links)
- (Q5021011) (← links)
- (Q5090498) (← links)
- (Q5129949) (← links)
- (Q5207050) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- Implementation and Application of Automata (Q5464000) (← links)
- Projection for Büchi Tree Automata with Constraints between Siblings (Q5859646) (← links)
- Logic and Branching Automata (Q5895230) (← links)
- On the power of finite ambiguity in Büchi complementation (Q6040669) (← links)
- Modular mix-and-match complementation of Büchi automata (Q6535356) (← links)
- Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation (Q6535611) (← links)
- Simulations in rank-based Büchi automata complementation (Q6536321) (← links)
- Constructing deterministic parity automata from positive and negative examples (Q6586928) (← links)
