The following pages link to Decision problems forω-automata (Q5573396):
Displayed 50 items.
- Logic, semigroups and automata on words (Q1817074) (← links)
- Characterization of \(\omega\)-regular languages by monadic second-order formulas (Q1822511) (← links)
- On omega context free languages which are Borel sets of infinite rank. (Q1874398) (← links)
- Descriptive set theory, from Cantor to Wadge and beyond (Q2148861) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Certifying inexpressibility (Q2233423) (← links)
- Infinite behaviour of Petri nets (Q2265817) (← links)
- Shift-invariant topologies for the Cantor space \(X^{\omega}\) (Q2357113) (← links)
- Bounded model checking of infinite state systems (Q2369883) (← links)
- Topology, monitorable properties and runtime verification (Q2453532) (← links)
- A complete characterization of deterministic regular liveness properties (Q2465051) (← links)
- Relating word and tree automata (Q2576943) (← links)
- Subword Metrics for Infinite Words (Q2947418) (← links)
- A note on accelerated Turing machines (Q3061156) (← links)
- Some problems in automata theory which depend on the models of set theory (Q3117545) (← links)
- Automata Theory and Model Checking (Q3176362) (← links)
- Saturating right congruences (Q3204049) (← links)
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES (Q3395145) (← links)
- The Wadge Hierarchy of Petri Nets ω-Languages (Q3455844) (← links)
- Mechanizing the Powerset Construction for Restricted Classes of ω-Automata (Q3510798) (← links)
- On the continuity set of an Omega rational function (Q3514642) (← links)
- Complexity of Topological Properties of Regular ω-Languages (Q3533038) (← links)
- The Quest for a Tight Translation of Büchi to co-Büchi Automata (Q3586001) (← links)
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (Q3602799) (← links)
- Highly Undecidable Problems For Infinite Computations (Q3625697) (← links)
- Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata (Q3644751) (← links)
- Sequential mappings of $\omega $-languages (Q3773367) (← links)
- Rebootable and suffix-closed $\omega $-power languages (Q3991292) (← links)
- THE WAGNER HIERARCHY (Q4513311) (← links)
- The Wadge-Wagner hierarchy of ω-rational sets (Q4571937) (← links)
- ON RECOGNIZABLE LANGUAGES OF INFINITE PICTURES (Q4652792) (← links)
- On the Topological Complexity of Infinitary Rational Relations (Q4825475) (← links)
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations (Q4825476) (← links)
- (Q5021006) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- Solving Infinite Games in the Baire Space (Q5038566) (← links)
- On the classification of computable languages (Q5048927) (← links)
- Multi-Valued Reasoning about Reactive Systems (Q5060674) (← links)
- On Repetition Languages (Q5089230) (← links)
- Minimizing GFG Transition-Based Automata (Q5091262) (← links)
- On the High Complexity of Petri Nets $$\omega $$-Languages (Q5100750) (← links)
- (Q5101349) (← links)
- Backward Deterministic Büchi Automata on Infinite Words (Q5136295) (← links)
- How Deterministic are Good-For-Games Automata? (Q5136308) (← links)
- Polishness of some topologies related to word or tree automata (Q5376660) (← links)
- Automata, Borel functions and real numbers in Pisot base (Q5444100) (← links)
- TYPENESS FOR ω-REGULAR AUTOMATA (Q5484907) (← links)
- Level Two of the Quantifier Alternation Hierarchy over Infinite Words (Q5740188) (← links)
- An introduction to metric semantics: Operational and denotational models for programming and specification languages (Q5941193) (← links)
- Topological properties of omega context-free languages (Q5958141) (← links)