References
- Culik , K. II and Karhumäki , J. 1986 . The equivalence of finite valued transducers (on HDT0L) languages is decidable . Theoretical Computer Science , 47 : 71 – 84 .
- Rozenberg and G . 1972 . The equivalence problem for deterministic T0L-systems is undecidable . Information Processing Letters , 1 : 201 – 204 .
- Salomaa , A . 1973 . On sentential forms of context-free grammars . Acta Informatica , 2 : 40 – 49 .
- Dekking , F. M. 1994 . Iteration of maps by an automaton . Discrete Mathematics , 126 : 81 – 86 .
- Honkala and J . 2005 . The language equivalence problem for HD0L systems having D0L growths . Theoretical Computer Science , 330 : 123 – 133 .
- Karhumäki , J. and Lisovik , L. P . 2003 . The equivalence problem of finite substitutions on ab*c, with applications . International Journal of Foundations of Computer Science , 14 : 699 – 710 .
- Berstel , J. 1979 . Transductions and Context-Free Languages , Stuttgart : Teubner .
- Rozenberg , G. and Salomaa , A. 1980 . The Mathematical Theory of L Systems , New York : Academic Press .
- Rozenberg , G. and Salomaa , A. 1997 . Handbook of Formal Languages , Edited by: Rozenberg , G. and Salomaa , A. Vol. 1–3 , Berlin : Springer .
- Salomaa , A. and Soittola , M. 1978 . Automata-Theoretic Aspects of Formal Power Series , Berlin : Springer .
- Allouche , J.-P. and Shallit , J. 2003 . Automatic Sequences: Theory, Applications, Generalizations , Cambridge : Cambridge University Press .
- Culik , K. II and Fris , I. 1977 . The decidability of the equivalence problem for D0L-systems . Information and Control , 35 : 20 – 39 .
- Nielsen and M . 1974 . On the decidability of some equivalence problems for D0L systems . Information and Control , 25 : 166 – 193 .
- Berstel , J. , Nielsen and M . 1976 . “ The growth range equivalence problem for D0L systems is decidable ” . In Automata, Languages, Development , Edited by: Lindenmayer , A. and Rozenberg , G. 161 – 178 . Amsterdam : North-Holland .