Abstract
Let w be a word and A a language of a finitely generated free monoid Σ*. We say that w is ambiguously covered by A if there exist words α and β in A, with α ≠ β, such that w ε pref(αA+) ∑ pref(βA+). We show that if A is a three-element code then any two words which are ambiguously covered by A are comparable, i.e., one of them is a prefix of another. This property is characteristic for three-element codes.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berstel,J. and Perrin,D., The Theory of Codes, (to appear).
Harrison, M., Introduction to Formal Language Theory, Addison-Wesley, Reading, Mass. (1978).
Lothaire, M., Combinatorics on words, Addison-Wesley, Reading, Mass. (1983).
Salomaa, A., Jewels of Formal Language Theory, Computer Science Press, Maryville (1981).
Schützenberger,M.P., Une theorie algebraique du codage, Seminaire Dubreil-Pisot, annee 55–56, exp. n. 15 Inst. Henri Poincare, Paris (1956).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karhumäki, J. (1984). A property of three-element codes. In: Fontet, M., Mehlhorn, K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12920-0_28
Download citation
DOI: https://doi.org/10.1007/3-540-12920-0_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12920-2
Online ISBN: 978-3-540-38805-0
eBook Packages: Springer Book Archive