Which finite monoids are syntactic monoids of rational \(\omega\)-languages

DOI10.1016/0020-0190(92)90135-IzbMath0780.68086OpenAlexW1991429561MaRDI QIDQ1198042

Do Long Van, Phan Trung Huy, Igor Litovsky

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90135-i

zbMATH Keywords

syntactic monoidfinite monoid\(\omega\)-rigid setsrational \(\omega\)-language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Finite-state \(\omega\)-languages
• A syntactic congruence for rational \(\omega\)-languages
• On?-Languages whose syntactic monoid is trivial
• Unnamed Item
• Unnamed Item

This page was built for publication: Which finite monoids are syntactic monoids of rational \(\omega\)-languages