Hypercodes, Right Convex Languages and their Syntactic Monoids

DOI10.2307/2043506MaRDI QIDQ3933182zbMATH OpenOpenAlexFDO

Authors Gabriel Thierrin

Publication date 1981

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

zbMATH Keywords

embedding orderfree monoidhypercodenil monoidprincipal congruencesemilatticesyntactic monoid

Mathematics Subject Classification ID

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

Cites work

• Homomorphisms and subdirect decompositions of semigroups
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3252233 (Why is no real title available?)
• Hypercodes
• Inf-Halbverbände als syntaktische Halbgruppen
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras
• The syntactic monoid of a hypercode

Cited in

(5)

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

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

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