The syntactic monoid of the semigroup generated by a maximal prefix code

DOI10.1090/S0002-9939-96-03271-6MaRDI QIDQ4875509zbMATH OpenFDO

Authors Mario Petrich, Gabriel Thierrin, Cecília M. Reis

Publication date 8 December 1996

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/S0002-9939-96-03271-6

zbMATH Keywords

prefix codesrelatively general codesright groupsright zero semigroupssemantic congruencessyntactic congruencessyntactic monoids

Mathematics Subject Classification ID

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

Recommendations

• On syntactic groups.
• The syntactic monoid of the semigroup generated by a comma-free code
• Recent results on syntactic groups of prefix codes.
• Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes

Cited in

(12)

• Biprefix codes, inverse semigroups and syntactic monoids of injective automata
• Finite codes and groupoid words
• Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
• The syntactic monoid of hairpin-free languages
• The Syntactic Monoid of an Infix Code
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• scientific article; zbMATH DE number 3901054 (Why is no real title available?)
• scientific article; zbMATH DE number 1354855 (Why is no real title available?)
• Recent results on syntactic groups of prefix codes.
• The syntactic monoid of the semigroup generated by a comma-free code
• On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups
• On the groups of codes with empty kernel.

This page was built for publication: The syntactic monoid of the semigroup generated by a maximal prefix code

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