References
References
- Gusfield D (1997) Algorithms on Strings, Trees, and Sequences, Cambridge University Press
- Kari , L and Thierrin , G . (1998) . Words insertions and primitivity . Utilitas Math. , 53 : 49 – 61 .
- Hopcroft JE Ullman JD (1969) Formal Languages and Their Relation to Automata, Addison-Wesley Pub. Company
- Lyndon , RC and tzenberger , MP . (1962) . The equation aM = bNcP in a free group . Mich. Math. J. , 9 : 289 – 298 .
- Hsiao , HK , Huang , CC and Yu , SS . (2002) . Word operation closure and primitivity of languages . JUCS , 8 ( 2 ) : 243 – 256 .
- Reis , CM and Shyr , HJ . (1978) . Some properties of disjunctive languages on a free monoid . Inf. Control , 37 ( 3 ) : 334 – 344 .
- Shyr , HJ and Yu , SS . (1994) . Non-primitive words in the language p + q + . Soochow J. Math. , 24 ( 4 ) : 535 – 546 .
- Shyr , HJ and Thierrin , G . (1977) . Disjunctive languages and codes . Fundamentals of Computation Theory, Proceedings of the 1977 Inter. FCT-Conference, Poznan, Poland, Lecture Notes in Computer Science, Springer-Verlag , 56 : pp. 171–176
- Yu , SS . (2000) . Palindrome words and reverse closed languages . Int. J. Comput. Math. , 75 : 389 – 402 .
- Chu , DD and Town , TS . (1978) . Another proof on a theorem of Lyndon and Schützenberger in a free monoid . Soochow J. Math. , 4 : 143 – 146 .
- Hsiao , HK , Yu , SS and Zhao , YK . (2004) . Word-paired insertions of languages, . Int. J. Comput. Math. , 81 : 169 – 181 .