The following pages link to Decision problems forω-automata (Q5573396):
Displaying 50 items.
- Local rule distributions, language complexity and non-uniform cellular automata (Q393151) (← links)
- On the classification of recursive languages (Q598240) (← links)
- Characterizations of rational \(\omega\)-languages by means of right congruences (Q673632) (← links)
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- \(\omega\)-regular languages are testable with a constant number of queries (Q706616) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- Alternating finite automata on \(\omega\)-words (Q796990) (← links)
- The residue of vector sets with applications to decidability problems in Petri nets (Q797285) (← links)
- Projection lemmas for \(\omega\)-languages (Q797297) (← links)
- Characterization of \(\omega\)-regular languages by first-order formulas (Q800737) (← links)
- A taxonomy of fairness and temporal logic problems for Petri nets (Q805257) (← links)
- Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← links)
- Profile trees for Büchi word automata, with application to determinization (Q897653) (← links)
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction (Q917321) (← links)
- Topological complexity of locally finite \(\omega\)-languages (Q944222) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- A note on \(\omega\)-regular languages (Q1053464) (← links)
- A classification of \(\omega\)-regular languages (Q1058863) (← links)
- Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions (Q1079373) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- Topological characterizations of infinite tree languages (Q1092675) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Accepting conditions for automata on \(\omega\)-languages (Q1116351) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Language-theoretical representations of \(\omega\)-languages (Q1123638) (← links)
- Terminal metric spaces of finitely branching and image finite linear processes (Q1128985) (← links)
- On the complexity of \(\omega\)-type Turing acceptors (Q1138912) (← links)
- The Hausdorff-Kuratowski hierarchy of \(\omega\)-regular languages and a hierarchy of Muller automata (Q1184990) (← links)
- Fairness, distances and degrees (Q1193862) (← links)
- Strong fairness and ultra metrics (Q1193893) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- A decidability result for deterministic \(\omega\)-context-free languages (Q1239008) (← links)
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages (Q1240574) (← links)
- Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
- \(\omega\)-computations on Turing machines (Q1242685) (← links)
- \(\omega\)-computations on deterministic pushdown machines (Q1247962) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- Various hierarchies of \(\omega\)-regular sets (Q1269921) (← links)
- Index sets in computable analysis (Q1292400) (← links)
- A branching time logic with past operators (Q1337463) (← links)
- Chain automata (Q1351952) (← links)
- Somewhat finite approaches to infinite sentences. (Q1353892) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
- Unambiguous Büchi automata. (Q1401292) (← links)
- Effectively closed sets and graphs of computable real functions. (Q1607292) (← links)
- Spanning the spectrum from safety to liveness (Q1629750) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- Weak Muller acceptance conditions for tree automata (Q1770388) (← links)
