The Syntactic Monoid of an Infix Code

DOI10.2307/2048111zbMath0712.68061OpenAlexW4256129780MaRDI QIDQ3197337

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) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Related Items (3)

The syntactic monoid of hairpin-free languages ⋮ Automata for solid codes ⋮ Dependences related to strict binary relations

Cites Work

• Unnamed Item
• Unnamed Item
• Sur la théorie des demi-groupes
• Homomorphisms and subdirect decompositions of semigroups
• The syntactic monoid of a hypercode

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