scientific article; zbMATH DE number 4009840
From MaRDI portal
Publication:3759953
zbMATH Open0622.68064MaRDI QIDQ3759953FDOQ3759953
Authors: Helmut Jürgensen, Gabriel Thierrin 
Publication date: 1986
Title of this publication is not available (Why is that?)
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
rewriting systemssyntactic monoids\(\omega \)-languagesfinitely generated monoidpresentations of monoidsshuffles of \(\infty \)- languages
Cited In (7)
- On?-Languages whose syntactic monoid is trivial
- Over Which Monoids is the Transducer Determinization Procedure Applicable?
- The disjunctivities of \(\omega\)-languages.
- Syntactic monoids in a category
- Which finite monoids are syntactic monoids of rational \(\omega\)-languages
- Title not available (Why is that?)
- Embedding finite and infinite words into overlapping tiles (short paper)
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)
