The following pages link to Finite-state \(\omega\)-languages (Q794443):
Displaying 27 items.
- Learning regular omega languages (Q329611) (← links)
- Characterizations of rational \(\omega\)-languages by means of right congruences (Q673632) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Finite automata encoding geometric figures (Q995557) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages (Q1198042) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- On syntactic congruences for \(\omega\)-languages (Q1391139) (← links)
- Efficient minimization of deterministic weak \(\omega\)-automata (Q1603452) (← links)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- The disjunctivities of \(\omega\)-languages. (Q1811081) (← links)
- Iterated function systems and control languages (Q1854440) (← links)
- Regular \(\omega\)-languages with an informative right congruence (Q2029605) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Concurrent Kleene algebra with observations: from hypotheses to completeness (Q2200836) (← links)
- Ambiguity, weakness, and regularity in probabilistic Büchi automata (Q2200844) (← links)
- Shift-invariant topologies for the Cantor space \(X^{\omega}\) (Q2357113) (← links)
- Classifying recognizable infinitary trace languages using word automata (Q2407086) (← links)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages (Q2945564) (← links)
- Subword Metrics for Infinite Words (Q2947418) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- (Q3384896) (← links)
- The topological structure of adherences of regular languages (Q3747749) (← links)
- Rebootable and suffix-closed $\omega $-power languages (Q3991292) (← links)
- (Q5875345) (← links)
