Factorization in Formal Languages
We consider several language-theoretic aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(L). We observe that uf(L) need not be context-free if L is context-free.
Next, we consider some variations on unique factorization. We define a notion of “semi-unique” factorization, where every factorization has the same number of terms, and show that, if L is regular or even finite, the set of words having such a factorization need not be context-free. Finally, we consider additional variations, such as unique factorization “up to permutation” and “up to subset”. Although all these variations have been considered before, it appears that the languages of words having these properties have not been positioned in the Chomsky hierarchy up to now. We also consider the length of the shortest word not having the desired property.
KeywordsCharacteristic Vector Formal Language Regular Language Unique Factorization Distinct Factorization
Unable to display preview. Download preview PDF.
- 1.Berstel, J., Perrin, D., Reutenauer, C.: Codes and automata. In: Encyclopedia of Mathematics and its Applications, vol. 129. Cambridge University Press (2010)Google Scholar
- 4.Head, T., Weber, A.: Deciding code related properties by means of finite transducers. In: Capocelli, R., De Santis, A., Vaccaro, U. (Eds.) Sequences II: Methods in Communication, Security, and Computer Science, pp. 260–272. Springer (1993)Google Scholar
- 6.Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)Google Scholar
- 8.Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (Eds.) Handbook of Formal Languages, Word, Language, Grammar, vol. 1, pp. 511–607. Springer (1991)Google Scholar
- 12.Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press (2009)Google Scholar
- 13.Szelepcsényi, R.: The method of forcing for nondeterministic automata. Bull. EATCS 33, 96–100 (1987)Google Scholar