Prime Decomposition Problem for Several Kinds of Regular Codes
Given a class C of codes. A regular code in C is called prime if it cannot be decomposed as a catenation of at least two non-trivial regular codes in C. The prime decomposition problem for the class C of codes consists in decomposing regular codes in C into prime factors in C. In this paper, a general approach to this problem is proposed, by means of which solutions for the prime decomposition problem are obtained, in a unified way, for several classes of codes. These classes are all subclasses of prefix codes and can be defined by binary relations.
KeywordsCode invariant relation prime decomposition problem
Unable to display preview. Download preview PDF.
- 8.Hung, K.V., Khang, N.Q.: An embedding algorithm for supercodes and sucypercodes. Vietnam J. Math. 33, 119–206 (2005)Google Scholar
- 12.Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 511–607. Springer, Heidelberg (1997)Google Scholar
- 13.Mateescu, A., Salomaa, A., Yu, S.: On the decomposition of finite languages, Technical Report 222, TUCS (1998)Google Scholar
- 17.Long Van, D., Hung, K.V.: An approach to the embedding problem for codes defined by binary relations. In: Proceedings of CAI, Greece, pp. 111–127 (2005)Google Scholar