On certain codes admitting inverse semigroups as syntactic monoids

DOI10.1007/BF02194775zbMath0287.20062MaRDI QIDQ1845834

Gerard Lallement, Michael Keenan

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

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

Related Items (6)

Gérard Lallement (1935-2006) ⋮ 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 ⋮ Inverse semigroups and varieties of finite semigroups ⋮ Biprefix codes, inverse semigroups and syntactic monoids of injective automata

Cites Work

• Unnamed Item
• The translational hull in semigroups and rings
• Extensions of a Brandt Semigroup by Another
• On a Special Class of Recurrent Events
• Codes conjugués

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