Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-15T01:20:39.074Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  14 November 2011

Mario Petrich  and
C. M. Reis
Mario Petrich
Affiliation:
Department of Mathematics, University of Western Ontario, London, Ontario N6A 5B7, Canada
C. M. Reis
Affiliation:
Department of Mathematics, University of Western Ontario, London, Ontario N6A 5B7, Canada
Get access Rights & Permissions [Opens in a new window]

Abstract

A sequence of lemmas leads to a two-fold characterisation of the syntactic monoid in the title. Some alternatives as well as special cases, in particular when the code consists of a singleton, are considered.

Type
Research Article
Information
Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 125 , Issue 1 , 1995 , pp. 165 - 179
Copyright
Copyright © Royal Society of Edinburgh 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1Berstel, J. and Perrin, D.. Theory of Codes (New York: Academic Press, 1985).Google Scholar
2Golomb, S. W., Gordon, B. and Welch, L. R.. Comma-free codes. Canad. J. Math. 10 (1958), 202–209.CrossRefGoogle Scholar
3Petrich, M.. Introduction to Semigroups (Columbus: Merrill, 1973).Google Scholar
4Shyr, H. J.. Free Monoids and Languages (Taichung, Taiwan ROC: Hon Min Book Company, 1991).Google Scholar