Pages that link to "Item:Q1098325"
From MaRDI portal
The following pages link to Alternating automata on infinite trees (Q1098325):
Displaying 13 items.
- (Q5129949) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- Alternating automata: Unifying truth and validity checking for temporal logics (Q5234701) (← links)
- Ramsey-Based Inclusion Checking for Visibly Pushdown Automata (Q5277899) (← links)
- The Complexity of CTL* + Linear Past (Q5458359) (← links)
- BÜCHI COMPLEMENTATION MADE TIGHTER (Q5484906) (← links)
- Converting a Büchi alternating automaton to a usual nondeterministic one (Q5955787) (← links)
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic (Q6104378) (← links)
- A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings (Q6137852) (← links)
- A space-efficient on-the-fly algorithm for real-time model checking (Q6162102) (← links)
- From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q6535954) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- A Nivat theorem for weighted alternating automata over commutative semirings (Q6649528) (← links)