Pages that link to "Item:Q1098325"

The following pages link to Alternating automata on infinite trees (Q1098325):

Displaying 50 items.

• Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
• Improved model checking of hierarchical systems (Q418123) (← links)
• \textit{Once} and \textit{for all} (Q439961) (← links)
• Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
• The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity (Q477204) (← links)
• An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383) (← links)
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
• Visibly linear temporal logic (Q682377) (← 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)
• Strategy logic (Q979080) (← links)
• Alternating tree automata (Q1077932) (← links)
• Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
• Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
• Determinization and memoryless winning strategies (Q1357005) (← links)
• Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
• From bidirectionality to alternation. (Q1401248) (← links)
• A gap property of deterministic tree languages. (Q1401364) (← links)
• Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
• Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
• Decidability of infinite-state timed CCP processes and first-order LTL (Q1763732) (← links)
• \( \omega \)-automata (Q2074208) (← links)
• Automata on infinite trees (Q2074210) (← links)
• A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
• From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688) (← links)
• Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
• Dynamic control with indistinguishable events (Q2256883) (← links)
• Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
• Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
• Complexity results on branching-time pushdown model checking (Q2373715) (← links)
• Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
• Complementation of Coalgebra Automata (Q2888479) (← links)
• Reasoning About Strategies (Q2946746) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• \(L\)-valued alternating tree automata (Q3306921) (← links)
• SEMI-AUTOMATIC DISTRIBUTED SYNTHESIS (Q3426790) (← links)
• An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
• PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
• Description Logics (Q3638996) (← links)
• (Q3748266) (← links)
• (Q4036177) (← links)
• Church's Problem Revisited (Q4262605) (← links)
• Alternating Tree Automata and Parity Games (Q4412832) (← links)
• (Q4510804) (← links)
• (Q4695499) (← links)
• Deciding low levels of tree-automata hierarchy (Q4916202) (← links)
• The<i>μ</i>-calculus alternation-depth hierarchy is strict on binary trees (Q4943546) (← links)
• (Q5009427) (← links)
• (Q5028483) (← links)