References
- Culik , K. II and Harju , T. (1984) . The ω-sequence equivalence problem for D0L systems is decidable . JACM , 31 : 282 – 298 .
- Rozenberg G. Salomaa A. The Mathematical Theory of L Systems Academic Press New York (1980)
- G. Rozenberg and A. Salomaa (Eds.) Handbook of Formal Languages Vol. 1–3 Springer Berlin (1997)
- Culik , K. II and Salomaa , A. (1982) . On infinite words obtained by iterating morphisms . Theoret. Comput. Sci. , 19 : 29 – 38 .
- Honkala J. A bound for the ω-equivalence problem of polynomial D0L systems Theoret. Inform. Appl. (to appear)
- Honkala , J. (2002) . Remarks concerning the D0L ω-equivalence problem . Intern. J. Foundat. Comput. Sci. , 13 : 769 – 777 .
- Ruohonen K. Test sets for iterated morphisms Report 49 Tampere University of Technology Tampere (1986)
- Honkala , J. (2000) . A short solution for the HDT0L sequence equivalence problem . Theoret. Comput. Sci. , 244 : 267 – 270 .
- Berstel J. Reutenauer C. Rational Series and Their Languages Springer Berlin (1988)
- Salomaa A. Soittola M. Automata—Theoretic Aspects of Formal Power Series Springer Berlin (1978)
- Ruohonen , K. (1979) . The inclusion problem for D0L languages . Elektron. Informationsverarb. Kybernet. , 15 : 535 – 548 .