1. L. M. Adleman, Molecular computation of solutions to combinatorial problems, Science, 226, (1994), 1021–1024.
2. J. Berstel, D. Perrin, Theory of codes, Academic Press, New York, (1985).
3. J. Berstel, A. Restivo, Codes et sousmonoides fermes par conjugaison, Sem. LITP, 81–45, (1981), 10 pages.
4. P. Bonizzoni, R. Zizza, Deciding whether a regular language is a splicing language, submitted, (1999).
5. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Circular splicing and regular languages, manuscript, (2000).