scientific article; zbMATH DE number 599132

MaRDI QIDQ4297397zbMATH OpenFDO

Authors Hugues Calbrix, M. Nivat, Andreas Podelski

Publication date 22 September 1994

zbMATH Keywords

rational \(\omega\)-languagessyntactic congruencesultimately periodic words

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• Ultimately periodic words of rational ω-languages
• Characterizations of rational \(\omega\)-languages by means of right congruences
• A syntactic congruence for rational -languages
• scientific article; zbMATH DE number 5051550
• scientific article; zbMATH DE number 512864

Cited in

(12)

• Quasi-periodic \(\beta\)-expansions and cut languages
• Deciding monadic second order logic over -words by specialized finite automata
• Learning regular omega languages
• Query learning of derived \(\omega\)-tree languages in polynomial time
• Reduced Languages as ω-Generators
• scientific article; zbMATH DE number 5051550 (Why is no real title available?)
• Approximate verification of the symbolic dynamics of Markov chains
• Ultimately periodic words of rational ω-languages
• Representing regular languages of infinite words using mod 2 multiplicity automata
• Antichains algorithms for the inclusion problem between \(\omega\)-VPL
• Characterizations of rational \(\omega\)-languages by means of right congruences
• A theory of ultimately periodic languages and automata with an application to time granularity

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297397)