References
- Culik Ii , K. and Harju , T. 1981 . The w-sequence Equivalence Problem for DOL Systems is Decidable . Proc. 13th ACM Symp. on Theory of Computing , : 1 – 6 .
- Culik Ii , K. and Salomaa , A. 1982 . On Infinite Words obtained by Iterating Morphisms . Theoretical Computer Science , 19 : 29 – 38 .
- Culik Ii , K. and Wood , D. 1979 . Doubly Deterministic Tabled OL Systems . Internat. J. Comput. Inform.Sci , 8 : 335 – 347 .
- Harrison , J. 1995 . Dynamical Properties of PWDOL Systems . Theoretical Computer Science , 146
- Harrison , J. 1994 . Morphic Congruences and DOL Languages . Theoretical Computer Science , 136
- Harrison J. On Almost Cylindrical Languages and the Decidability of the DOL and PWDOL Primitivity Problems preprint
- Head , T. 1984 . Adherences of DOL Languages . Theoretical Computer Science , 31 : 139 – 149 .
- Hopcroft , J. and Ullman , J. 1979 . Introduction to Automata Theory, Languages and Computation , Menlo Park, California : Addison-Wesley .
- Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory ofL Systems , New York : Academic Press .