Hypercodes, Right Convex Languages and their Syntactic Monoids

DOI10.2307/2043506zbMath0476.20042OpenAlexW4255465288MaRDI QIDQ3933182

Gabriel Thierrin

Publication date: 1981

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

zbMATH Keywords

semilatticefree monoidprincipal congruencesyntactic monoidhypercodeembedding ordernil monoid

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 (5)

Monoids with disjunctive identity and their codes ⋮ A note on r-extensible prefix codes ⋮ Insertion and deletion closure of languages ⋮ Outfix and infix codes and related classes of languages ⋮ Automata for solid codes

Cites Work

• Unnamed Item
• Unnamed Item
• Homomorphisms and subdirect decompositions of semigroups
• The syntactic monoid of a hypercode
• Inf-Halbverbände als syntaktische Halbgruppen
• Hypercodes
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Hypercodes, Right Convex Languages and their Syntactic Monoids