The following pages link to (Q4385530):
Displayed 50 items.
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- A topological property of rational \(\omega\)-languages (Q671988) (← links)
- The monadic second-order logic of graphs. IX: Machines and their behaviours (Q671992) (← links)
- An initial semantics for the \(\mu\)-calculus on trees and Rabin's complementation lemma (Q672383) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
- Towards a descriptive set theory for domain-like structures (Q854185) (← links)
- Vertex-minors, monadic second-order logic, and a conjecture by Seese (Q858683) (← links)
- Automata on linear orderings (Q859978) (← links)
- On decidability properties of local sentences (Q860837) (← links)
- Observations on determinization of Büchi automata (Q860867) (← links)
- Skew and infinitary formal power series (Q860889) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Inferring answers to queries (Q927868) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- Verification of well-formed communicating recursive state machines (Q944388) (← links)
- Fine hierarchies and m-reducibilities in theoretical computer science (Q949621) (← links)
- Finite automata encoding geometric figures (Q995557) (← links)
- Processes with local and global liveness requirements (Q1007234) (← links)
- Topology on words (Q1019711) (← links)
- Fine hierarchy of regular \(\omega\)-languages (Q1127312) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- On translations of temporal logic of actions into monadic second-order logic (Q1127537) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability (Q1176232) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- On automata on infinite trees (Q1186604) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- Infinite hypergraphs. II: Systems of recursive equations (Q1199532) (← links)
- Sooner is safer than later (Q1199553) (← links)
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable (Q1202930) (← links)
- The Borel hierarchy is infinite in the class of regular sets of trees (Q1210306) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- Semantics and strong sequentiality of priority term rewriting systems (Q1275017) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- Set constraints and automata (Q1286366) (← links)
- Dynamic linear time temporal logic (Q1295431) (← links)
- On D0L systems with immigration (Q1314370) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- A theory of timed automata (Q1322162) (← links)
- Monadic second-order definable graph transductions: a survey (Q1325847) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- Deterministic asynchronous automata for infinite traces (Q1338892) (← links)
- Rabin tree automata and finite monoids (Q1341736) (← links)