References
- Hsiao H. K. Yu S. S. Zhao Y. K. Word-paired catenation of regular languages (submitted)
- Shyr , H. J. (1980) . Ordered catenation and regular free disjunctive languages . Information and Control , 46 : 257 – 269 .
- Rozenberg , G. and Salomaa , A. (1996) . Watson–Crick complementarity, universal computations and genetic engineering, Leiden University . Computer Science Technical Report , 28
- Adleman , L. M. (1994) . Molecular computation of solutions to combinatorial problems . Science , 266 : 1021 – 1024 .
- Lipton , R. J. (1995) . DNA solutions of hard computational problems . Science , 268 : 542 – 544 .
- Hsiao H. K. Yeh Y. T. Yu S. S. A note of ins-primitive words (submitted)
- Hopcroft J. E. Ullman J. D. Formal Languages and Their Relation to Automata Addison-Wesley Pub. Company (1969)
- Reis , C. M. and Shyr , H. J. (1978) . Some properties of disjunctive languages on a free monoid . Information and Control , 37 : 334 – 344 .
- Lyndon , R. C. and Schützenberger , M. P. (1962) . The equation a M = b N c P in a free group . Michigan Math. J. , 9 : 289 – 298 .
- Shyr H. J. Thierrin G. Disjunctive languages and codes Fundamentals of Computation Theory, Proceedings of the 1977 Inter. FCT-Conference, Poznan, Poland Lecture Notes in Computer Science, No. 56, Springer-Verlag (1977) pp. 171–176
- Yu , S. S. (2000) . Palindrome words and reverse closed languages . Intern. J. Computer Math. , 75 : 389 – 402 .