References
- Gusfield , D. 1997 . Algorithms on Strings, Trees and Sequences , Cambridge University Press .
- Huang , C. C. and Zhao , Y. K. 2002 . A note of p-primitive regular expressions . Chin Yi Journal , 20 ( 2 ) : 543 – 551 .
- Lyndon , R. C. and Schützenberger , M. P. 1962 . The equation aM = bNcP in a free group . Michigan Math.J , 9 : 289 – 298 .
- Shyr , H. J. 1991 . “ Free monoids and languages ” . In Lecture Notes , Taichung, Taiwan : Institute of Applied Mathematics, National Chung-Hsing University .
- Shyr , H. J. 1996 . Completely μ(n) -reducible languages and n -annihilators of languages . Soochow Journal of Mathematics , 22 : 339 – 356 .
- Shyr , H. J. and Yu , S. S. 1998 . Regular component splittable languages . Acta Math. Hungar , 82 : 219 – 229 .
- Shyr , H. J. and Thierrin , G. 1975 . Left-noncounting languages, Inter. Jour. of Computer and Information Science , 4 ( 1 ) : 95 – 102 .
- Shyr , H. J. and Thierrin , G. Disjunctive languages and codes, fundamentals of computation theory . 1997 . in Proceedings of the 1997 International FCT-Conference, Poznan, Poland, Lecture Notes in Computer Science , pp. 171 – 176 . No. 56, Springer-Verlag .
- Yu , S. S. 2000 . Palindrome words and reverse closed languages . Intern. Jour. Comput. Math , 75 : 389 – 402 .
- Zhao , Y. K. 2003 . A characterization of p-primitive words . Chin Yi Journal , 21 ( 1 ) : 339 – 346 .