The following pages link to (Q5525343):
Displaying 50 items.
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- The complementation problem for Büchi automata with applications to temporal logic (Q1088653) (← links)
- Brzozowski hierarchy of \(\omega\)-languages (Q1095672) (← links)
- On generators of rational \(\omega\)-power languages (Q1095674) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- An introduction to the regular theory of fairness (Q1102102) (← links)
- On a subclass of \(\infty\)-regular languages (Q1104761) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Language-theoretical representations of \(\omega\)-languages (Q1123638) (← links)
- On translations of temporal logic of actions into monadic second-order logic (Q1127537) (← links)
- A regular characterization of graph languages definable in monadic second-order logic (Q1177179) (← links)
- Languages and scanners (Q1177931) (← links)
- Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
- On automata on infinite trees (Q1186604) (← links)
- A denotational theory of synchronous reactive systems (Q1193599) (← links)
- Alternating automata, the weak monadic theory of trees and its complexity (Q1193871) (← links)
- Infinite trees and automaton-definable relations over \(\omega\)-words (Q1199531) (← links)
- \(\infty\)-regular temporal logic and its model checking problem (Q1199535) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- A decidability result for deterministic \(\omega\)-context-free languages (Q1239008) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- An axiom system for the weak monadic second order theory of two successors (Q1253650) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- Various hierarchies of \(\omega\)-regular sets (Q1269921) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Dynamic linear time temporal logic (Q1295431) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- A theory of timed automata (Q1322162) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- Rabin tree automata and finite monoids (Q1341736) (← links)
- Completeness of a first-order temporal logic with time-gaps (Q1350524) (← links)
- Finite automata and ordinals (Q1351785) (← links)
- Fixed point characterization of infinite behavior of finite-state systems (Q1389678) (← links)
- Finite automata on timed \(\omega\)-trees (Q1395427) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- Unambiguous Büchi automata. (Q1401292) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Inference of \(\omega\)-languages from prefixes. (Q1426153) (← links)
- Systolic tree \(\omega\)-languages: The operational and the logical view (Q1575949) (← links)
- Decidable fragments of first-order temporal logics (Q1591203) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Finite variability interpretation of monadic logic of order (Q1606122) (← links)
- Factorisation of transition systems (Q1647774) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Interpreting the monadic second order theory of one successor in expansions of the real line (Q1650004) (← links)
- Fuzzy alternating Büchi automata over distributive lattices (Q1678419) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
