A syntactic congruence for rational \(\omega\)-languages
From MaRDI portal
Publication:1066675
DOI10.1016/0304-3975(85)90148-3zbMath0578.68057OpenAlexW2022136117MaRDI QIDQ1066675
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90148-3
Related Items
Ultimately periodic words of rational ω-languages, Well-quasi-orders and regular \(\omega\)-languages, Deterministic asynchronous automata for infinite traces, On generators of rational \(\omega\)-power languages, Rebootable and suffix-closed $\omega $-power languages, Learning regular omega languages, Inferring regular languages and \(\omega\)-languages, Etude syntaxique des parties reconnaissables de mots infinis. (Syntactic study of recognizable parts of infinite words), A geometrical view of the determinization and minimization of finite-state automata, On projective and separable properties, On syntactic congruences for \(\omega\)-languages, Characterizing classes of regular languages using prefix codes of bounded synchronization delay, An algorithmic approach for checking closure properties of Ω-regular languages, Unnamed Item, Logical definability on infinite traces, Characterizations of rational \(\omega\)-languages by means of right congruences, Which finite monoids are syntactic monoids of rational \(\omega\)-languages, Weak MSO with the unbounding quantifier, The stuttering principle revisited, Unnamed Item, A novel learning algorithm for Büchi automata based on family of DFAs and classification trees, The complexity of weakly recognizing morphisms, Logic, semigroups and automata on words, An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages, Operations on Weakly Recognizing Morphisms, \( \omega \)-automata, RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA, Wreath product and infinite words, Logical definability on infinite traces, Logic over words on denumerable ordinals, An extension of Kleene's and Ochmański's theorems to infinite traces, Omega-rational expressions with bounded synchronization delay
Cites Work
