4 research outputs found
On D0L systems with finite axiom sets
Get PDFWe 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
Review of "J. Honkala; The language equivalence problem for HD0L systems having D0L growths. Theoret. Comput. Sci. 330 (2005), no. 1, 123–133"
Get PDFOn images of D0L and DT0L power series
Get PDFAbstractThe D0L and DT0L power series are generalizations of D0L and DT0L languages. We continue the study of these series by investigating various decidability questions concerning the images of D0L and DT0L power series
