Abstract.
In the field of combinatorics on words, it is known that {u, v}, the language with two words is a code if and only if \(uv\neq vu\). But up to now general characterization for codes consisting of any three words has not been found. In 1998, Fan, Shyr and Yu provided a characterization for codes consisting of three d-primitive words. In this paper, we give characterizations for a code with three words in which one of the words is d-primitive.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fan, C.-M., Shyr, H.J., Yu, S.S. (1998) d-words and d-languages. Acta Informatica 35: 709-727
Karhumaki J. (1985) On three-element codes. Theoret. Comput. Sci. 40: 3-11
Karhumaki J. (1985) A property of three-element codes. Theoret. Comput. Sci. 41: 215-222
Karhumaki J., Latteux M., Petre I. (2003) The commutation with codes and ternary sets of words. STACS
Li, Z.-Z., Shyr, H.J., Tsai, Y.S. (2004) Annihilators of bifix codes. (Submitted for publication)
Li, Z.-Z., Tsai, Y.S., Yih, G.-C. (2004) Characterizations on codes with three elements. Soochow Journal of Mathematics 30(2): 177-196 (2004)
Lyndon, R.C., Schützenberger, M.P. (1962) The equation a M=b N c P in a free group. Michigan Math. J. 9: 289-298
Shyr, H.J. (2001) Free monoids and languages, 3rd edn. Hon Min Book Company, Taichung, Taiwan
Shyr, H.J., Yu, S.S. (1994) Languages defined by two functions. Soochow Journal of Mathematics 20(3): 279-296
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 7 June 2004, Published online: 29 October 2004
Rights and permissions
About this article
Cite this article
Li, ZZ., Tsai, Y.S. Three-element codes with one d-primitive word. Acta Informatica 41, 171–180 (2004). https://doi.org/10.1007/s00236-004-0155-x
Issue Date:
DOI: https://doi.org/10.1007/s00236-004-0155-x