The syntactic monoid of the semigroup generated by a comma-free code

DOI10.1017/S030821050003081XMaRDI QIDQ4698382zbMATH OpenFDO

Authors Mario Petrich, Cecília M. Reis

Publication date 13 February 1996

Published in Proceedings of the Royal Society of Edinburgh: Section A Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S030821050003081X

zbMATH Keywords

idempotentssyntactic congruencesreductive monoidssyntactic monoidslanguagescomma-free codes

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• The syntactic monoid of the semigroup generated by a maximal prefix code
• scientific article; zbMATH DE number 1354855
• Some properties of maximal comma-free codes
• A note on 1- (k,m)-comma-codes -- several studies on combinatorial semigroups. III

Cites work

• Comma-Free Codes

Cited in

(6)

• scientific article; zbMATH DE number 1354855 (Why is no real title available?)
• The syntactic monoid of hairpin-free languages
• WATSON-CRICK BORDERED WORDS AND THEIR SYNTACTIC MONOID
• A note on 1- (k,m)-comma-codes -- several studies on combinatorial semigroups. III
• A property of semaphore code
• On syntactic monoids of biunitary submonoids determined by homomorphisms from free semigroups onto completely simple semigroups

This page was built for publication: The syntactic monoid of the semigroup generated by a comma-free code

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