Open Access Open Access  Restricted Access Subscription Access

B-Codes and their relationship with alternative codes

Hien Thi Ngo

Abstract


Codes of bounded words (b-codes,  <>-codes), an extension of the notion of ordinary codes, have been first introduced and considered by P. T. Huy et al. in 2009. In this note, we consider some new subclasses of b-codes. In particular, characteristic properties of such codes are established. Also, relationship between b-codes, alternative codes and their subclasses are considered.

Keywords


Alternative code; b-code; norm b-code; two-side b-code; left b-code; strict b-code

Full Text:

PDF

References


M. K. Ahmad and X. Augros, “Some results on codes for generalized factorizations,” Journal of Automaton, Languages and Combinatorics, vol. 6, no. 3, pp. 239-251, 2001.

M. Anselmo, “Automates et codes zigzag,” RAIRO Theoretical Informatics and Applications, vol. 25, no. 1, pp. 49-66, 1991.

J. Berstel and D. Perrin, Theory of Codes. Academic Press, New York, 1985.

c. Câmpeanu, K. Salomaa, and s. Vágvolgyi, “Shuffle Quotient and Decompositions,” Lecture Notes in Computer Science, vol. 2295, pp. 186-196, 2002.

N. D. Han and P. T. Huy, “On unambiguity of languages related to codes,” in Future Information Technology, Application, and Service, J. p. James, c. M. L. Victor, L. W. Cho, and S. Taeshik, Ed. Springer Netherlands, pp. 32-38, 2012.

N. D. Han, H. N. Vinh, D. Q. Thang, and P. T. Huy, “Quadratic algorithms for testing of codes and <>-codes,” Fundamenta Informaticae, vol. 130, no. 2, pp. 163-177, 2014.

N. T. Hien, “Characterizations for several classes of alternative codes,” Journal of Computer Science and Cybernetics, vol. 32, pp. 273-283, 2016.

N. T. Hien, “On strong alt-induced codes,” Applied Mathematical Sciences, 2017, Submitted.

N. T. Hien and D. L. Van, “Codes induced by alternative codes,” Acta Mathematica Vietnammica, 2017, to appear. DOI: 10.1007/s40306-018-0247-2

P. T. Huy and V. T. Nam, “Alternative codes and pre-context codes,” in Proceedings of the 7th National Conference: Selected problems about IT and Telecommunication, 2004, pp. 188-197 (in Vietnamese).

H. Jurgensen and s. Konstantinidis, “Codes,” in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Ed. Springer, Berlin, pp. 511-607, 1997.

A. Lentin, “Equations dans les Monoides Libres,” Paris: Gauthier-Villars, 1972.

M. Madonia, s. Salemi, and T. Sportelli, “On z-submonoids and z-codes,” Theoretical Informatics and Applications, vol. 25, pp. 305-322, 1991.

M. Madonia, s. Salemi, and T. Sportelli, “Covering submonoids and covering codes,” Journal of Automaton, Languages and Combinatorics, vol. 4, no. 4, pp 333-350, 1999.

H. J. Shyr, Free Monoids and Languages. Hon Min Book Company, Taichung, 1991.

D. L. Van, B. L. Saec, and I. Litovsky, “On coding morphisms for zigzag codes,” Theoretical Informatics and Applications, vol. 26, no. 6, pp. 565-580, 1992.

H. N. Vinh and P. T. Huy, “Codes of bounded words,” in Proceedings of the 3rd International Conference on Computer and Electrical Engineering, vol. 2, pp. 89-95, 2010.

H. N. Vinh, P. T. Huy, and D. L. Van, “Regular <>-languages and codes,” in Proceedings of the 4th Fundamental and Applied IT Research, 2009, pp. 13-22 (in Vietnamese).

H. N. Vinh, P. T. Huy, and D. L. Van, “Extension of codes and algorithms for alternative codes and codes of bounded words,” Journal of Computer Science and Cybernetics, vol. 26, no. 4, pp. 301-311, 2010 (in Vietnamese).

H. N. Vinh, V. T. Nam, and P. T. Huy, “Codes based on unambiguous products,” Lecture Notes in Computer Science, vol. 6423, pp. 252-262, 2010.




Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology