scientific article; zbMATH DE number 4009840

MaRDI QIDQ3759953zbMATHFDO

Authors Helmut Jürgensen, Gabriel Thierrin

Publication date 1986

zbMATH Keywords

rewriting systemssyntactic monoids\(\omega \)-languagesfinitely generated monoidpresentations of monoidsshuffles of \(\infty \)- languages

Mathematics Subject Classification ID

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

Recommendations

• Which finite monoids are syntactic monoids of rational \(\omega\)-languages
• On?-Languages whose syntactic monoid is trivial
• scientific article; zbMATH DE number 4067251
• scientific article; zbMATH DE number 512864
• On syntactic congruences for \(\omega\)-languages
• scientific article; zbMATH DE number 1047940
• The syntactic monoid of hairpin-free languages
• A syntactic congruence for rational \(\omega\)-languages
• scientific article; zbMATH DE number 1150244
• scientific article; zbMATH DE number 7720791

Cited in

(7)

• On?-Languages whose syntactic monoid is trivial
• Which finite monoids are syntactic monoids of rational \(\omega\)-languages
• scientific article; zbMATH DE number 1101593 (Why is no real title available?)
• Syntactic monoids in a category
• The disjunctivities of \(\omega\)-languages.
• Embedding finite and infinite words into overlapping tiles (short paper)
• Over Which Monoids is the Transducer Determinization Procedure Applicable?

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 Q3759953)