On D0L systems with finite axiom sets
Juha Honkala 1
Acta Cybernetica 16 (2003) 29-35.
We give a new solution for the language equivalence problem of D0L systems with finite axiom sets by using the decidability of the equivalence problem of finite valued transducers on HDT0L languages proved by Culik II and Karhumäki.
Department of Mathematics, University of Turku, FIN-20014 Turku, Finland. Email: email@example.com Research supported by the Academy of Finland.
Web administrator 2003-10-13