The following pages link to (Q5616162):
Displayed 50 items.
- Reliability-aware automatic composition approach for web services (Q439793) (← links)
- Automata on infinite objects and their applications to logic and programming (Q582913) (← links)
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778) (← links)
- Automata-based axiom pinpointing (Q707741) (← links)
- Infinitary tree languages recognized by \(\omega\)-automata (Q794179) (← links)
- Hierarchies of weak automata and weak monadic formulas (Q805253) (← links)
- The monadic second-order logic of graphs. IV: Definability properties of equational graphs (Q807611) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- Variétés d'automates descendants d'arbres infinis (Q1079382) (← links)
- The greatest fixed-points and rational omega-tree languages (Q1082091) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Automata-theoretic techniques for modal logics of programs (Q1090675) (← links)
- Topological characterizations of infinite tree languages (Q1092675) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Logical definability of fixed points (Q1114673) (← links)
- Generalized automata on infinite trees and Muller-McNaughton's theorem (Q1178688) (← links)
- On automata on infinite trees (Q1186604) (← links)
- Finite automata on directed graphs (Q1191024) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- The Borel hierarchy is infinite in the class of regular sets of trees (Q1210306) (← links)
- An axiom system for the weak monadic second order theory of two successors (Q1253650) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- On modal mu-calculus and Büchi tree automata (Q1349728) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
- A gap property of deterministic tree languages. (Q1401364) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
- Ambiguous classes in \(\mu\)-calculi hierarchies (Q1770419) (← links)
- A characterization of Büchi tree automata (Q1847374) (← links)
- Fair simulation (Q1854506) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) (Q2011666) (← links)
- Automata on infinite trees (Q2074210) (← links)
- On the separation question for tree languages (Q2254515) (← links)
- A language hierarchy and kitchens-type theorem for self-similar groups (Q2324642) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Unambiguous Büchi Is Weak (Q2817398) (← links)
- On the Weak Index Problem for Game Automata (Q2947463) (← links)
- Temporal Logic and Fair Discrete Systems (Q3176360) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- On Monadic Theories of Monadic Predicates (Q3586024) (← links)
- On the Strength of Unambiguous Tree Automata (Q4683238) (← links)
- Deciding low levels of tree-automata hierarchy (Q4916202) (← links)
- (Q5015272) (← links)
- Automata on infinite trees with counting constraints (Q5044742) (← links)
- Type reconstruction with recursive types and atomic subtyping (Q5044773) (← links)