scientific article; zbMATH DE number 599132

zbMATH Open0917.20053MaRDI QIDQ4297397FDOQ4297397

Authors: Hugues Calbrix, M. Nivat, Andreas Podelski 

Publication date: 22 September 1994

Title of this publication is not available (Why is that?)

Recommendations

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

zbMATH Keywords

syntactic congruencesultimately periodic wordsrational \(\omega\)-languages

Mathematics Subject Classification ID

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

Cited In (11)

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

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)