Pages that link to "Item:Q1606130"
From MaRDI portal
The following pages link to Monadic second-order logic on tree-like structures (Q1606130):
Displaying 42 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- On the structure of graphs in the Caucal hierarchy (Q930912) (← links)
- Pushdown module checking (Q968362) (← links)
- Existential monadic second order logic on random rooted trees (Q1618231) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- CTL\(^\ast\) with graded path modalities (Q1784942) (← links)
- Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- On decidability of list structures (Q2332060) (← links)
- Characterizing weighted MSO for trees by branching transitive closure logics (Q2355685) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- Branch-width, parse trees, and monadic second-order logic for matroids. (Q2490835) (← links)
- Iterated pushdown automata and sequences of rational numbers (Q2498918) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- Monadic Second-Order Logic with Arbitrary Monadic Predicates (Q2922023) (← links)
- Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus (Q2946334) (← links)
- Capturing MSO with One Quantifier (Q2947170) (← links)
- Nearest Fixed Points and Concurrent Priority Games (Q2947896) (← links)
- Simple monadic theories and partition width (Q3170562) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- (Q3384164) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- Model Transformations in Decidability Proofs for Monadic Theories (Q3540168) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- The modal<i>μ</i>-calculus hierarchy over restricted classes of transition systems (Q3655261) (← links)
- (Q4474837) (← links)
- Shelah-Stupp’s Iteration and Muchnik’s Iteration (Q4643216) (← links)
- An Extension of Muchnik's Theorem (Q4673357) (← links)
- Semantical evaluations as monadic second-order compatible structure transformations (Q4738213) (← links)
- Monadic Second-Order Logic and Transitive Closure Logics over Trees (Q4917997) (← links)
- (Q5002827) (← links)
- (Q5014446) (← links)
- (Q5020998) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- (Q5129949) (← links)
- Monoidal-closed categories of tree automata (Q5220183) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465875) (← links)
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE (Q5483463) (← links)
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials (Q6563045) (← links)
- Fair \(\omega \)-regular games (Q6629447) (← links)
- Semiring provenance for Büchi games: strategy analysis with absorptive polynomials (Q6649515) (← links)
