The Syntactic Monoid of an Infix Code

DOI10.2307/2048111MaRDI QIDQ3197337zbMATH OpenOpenAlexFDO

Authors Mario Petrich, Gabriel Thierrin

Publication date 1990

Full work available at URL https://doi.org/10.2307/2048111

zbMATH Keywords

congruencesyntactic monoidinfix code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 4039328
• Infix Congruences on a Free Monoid
• scientific article; zbMATH DE number 1047940
• scientific article; zbMATH DE number 1354855
• The syntactic monoid of the semigroup generated by a maximal prefix code

Cites work

• scientific article; zbMATH DE number 4039328 (Why is no real title available?)
• scientific article; zbMATH DE number 3284302 (Why is no real title available?)
• Homomorphisms and subdirect decompositions of semigroups
• Sur la théorie des demi-groupes
• The syntactic monoid of a hypercode

Cited in

(10)

• scientific article; zbMATH DE number 1354855 (Why is no real title available?)
• The syntactic monoid of hairpin-free languages
• Dependences related to strict binary relations
• Automata for solid codes
• scientific article; zbMATH DE number 4039328 (Why is no real title available?)
• Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
• f-disjunctive congruences and a generalization of monoids with length
• Infix Congruences on a Free Monoid
• Monoids with disjunctive identity and their codes
• E-convex infix codes

This page was built for publication: The Syntactic Monoid of an Infix Code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197337)