Pages that link to "Item:Q1066675"
From MaRDI portal
The following pages link to A syntactic congruence for rational \(\omega\)-languages (Q1066675):
Displaying 44 items.
- On syntactic nuclei of rational languages (Q293361) (← links)
- Learning regular omega languages (Q329611) (← links)
- Weak MSO with the unbounding quantifier (Q537919) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Characterizations of rational \(\omega\)-languages by means of right congruences (Q673632) (← links)
- The greatest fixed-points and rational omega-tree languages (Q1082091) (← links)
- On generators of rational \(\omega\)-power languages (Q1095674) (← links)
- Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words) (Q1105050) (← links)
- Notes on congruence relations and factor pumping conditions for rational languages (Q1110344) (← links)
- Language-theoretical representations of \(\omega\)-languages (Q1123638) (← links)
- Prefix and equality languages of rational functions are co-context-free (Q1124356) (← links)
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages (Q1198042) (← links)
- An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages (Q1276242) (← links)
- A syntactic proof of the conservativity of \(\lambda_\omega\) over \(\lambda_2\) (Q1288430) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- Deterministic asynchronous automata for infinite traces (Q1338892) (← links)
- On projective and separable properties (Q1389766) (← links)
- On syntactic congruences for \(\omega\)-languages (Q1391139) (← links)
- Rational languages defined with a non-associative concatenation (Q1575941) (← links)
- Wreath product and infinite words (Q1587974) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Inferring regular languages and \(\omega\)-languages (Q1648037) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Well-quasi-orders and regular \(\omega\)-languages (Q1882913) (← links)
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees (Q2051763) (← links)
- \( \omega \)-automata (Q2074208) (← links)
- Omega-rational expressions with bounded synchronization delay (Q2354594) (← links)
- The stuttering principle revisited (Q2484066) (← links)
- Operations on Weakly Recognizing Morphisms (Q2829976) (← links)
- Acceptance Conditions for ω-Languages (Q3167506) (← links)
- Saturating right congruences (Q3204049) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- (Q3384896) (← links)
- (Q3759953) (← links)
- Rebootable and suffix-closed $\omega $-power languages (Q3991292) (← links)
- Characterizing classes of regular languages using prefix codes of bounded synchronization delay (Q4588867) (← links)
- Logical definability on infinite traces (Q4630272) (← links)
- (Q5090969) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
- (Q5485977) (← links)
- (Q5875345) (← links)
- Ultimately periodic words of rational ω-languages (Q5890066) (← links)
- An algorithmic approach for checking closure properties of Ω-regular languages (Q6162107) (← links)