Pages that link to "Item:Q5625141"
From MaRDI portal
The following pages link to Decidability of Second-Order Theories and Automata on Infinite Trees (Q5625141):
Displaying 50 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Regular languages of thin trees (Q290908) (← links)
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Automata-theoretic decision of timed games (Q386611) (← links)
- Cellular automata between sofic tree shifts (Q393113) (← links)
- The decidability of some classes of Stone algebras (Q412007) (← links)
- Temporal logics over linear time domains are in PSPACE (Q418122) (← links)
- On the almighty wand (Q418137) (← links)
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- Synthesis from scenario-based specifications (Q439960) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- A dynamic deontic logic for complex contracts (Q444496) (← links)
- Weak theories of concatenation and minimal essentially undecidable theories. An encounter of \(\mathsf{WTC}\) and \(\mathsf{S2S}\) (Q481870) (← links)
- Dynamical systems in categories (Q513904) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- Doomsday equilibria for omega-regular games (Q528193) (← links)
- Series-parallel languages on scattered and countable posets (Q533879) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Choice functions and well-orderings over the infinite binary tree (Q607442) (← links)
- Preface to the special issue: Temporal logics of agency (Q616042) (← links)
- Büchi context-free languages (Q627181) (← links)
- Automata and logics over finitely varying functions (Q636272) (← links)
- Model-theoretic complexity of automatic structures (Q636281) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- Classification of finite coloured linear orderings (Q651420) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← 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)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata (Q685507) (← links)
- Logical aspects of Cayley-graphs: the group case (Q705541) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- On mathematical contributions of Paul E. Schupp (Q716386) (← links)
- Counting branches in trees using games (Q729823) (← links)
- Program repair without regret (Q746769) (← links)
- Regular sets over extended tree structures (Q764339) (← links)
- On relation between linear temporal logic and quantum finite automata (Q783667) (← links)
- Infinitary tree languages recognized by \(\omega\)-automata (Q794179) (← links)
- Alternating finite automata on \(\omega\)-words (Q796990) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Trees, grids, and MSO decidability: from graphs to matroids (Q820150) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Automata-based verification of programs with tree updates (Q845236) (← links)
