On certain codes admitting inverse semigroups as syntactic monoids

DOI10.1007/BF02194775MaRDI QIDQ1845834zbMATH OpenFDO

Authors Michael Keenan, Gerard Lallement

Publication date 1974

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/134050

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• Codes conjugués
• Extensions of a Brandt Semigroup by Another
• scientific article; zbMATH DE number 3179521 (Why is no real title available?)
• On a Special Class of Recurrent Events
• The translational hull in semigroups and rings

Cited in

(6)

• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• Une topologie du monoide libre
• Regular semigroups with D=R as syntactic monoids of prefix codes
• On the syntactic transformation semigroup of a language generated by a finite biprefix code
• Gérard Lallement (1935-2006)
• Inverse semigroups and varieties of finite semigroups

This page was built for publication: On certain codes admitting inverse semigroups as syntactic monoids

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