scientific article

zbMATH Open0622.68064MaRDI QIDQ3759953FDOQ3759953

Helmut Jürgensen, Gabriel Thierrin

Publication date: 1986

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

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)

Cited In (5)

• On?-Languages whose syntactic monoid is trivial
• Over Which Monoids is the Transducer Determinization Procedure Applicable?
• The disjunctivities of \(\omega\)-languages.
• Which finite monoids are syntactic monoids of rational \(\omega\)-languages
• Title not available (Why is that?)

   Recommendations

• Which finite monoids are syntactic monoids of rational \(\omega\)-languages 👍 👎
• On?-Languages whose syntactic monoid is trivial 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On syntactic congruences for \(\omega\)-languages 👍 👎
• Title not available (Why is that?) 👍 👎
• The syntactic monoid of hairpin-free languages 👍 👎
• A syntactic congruence for rational \(\omega\)-languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)