On the equivalence problem of context-free and DT0L languages
It is undecidable whether or not a given context-free language and a propagating DT0L language are equal. We show that equivalence is decidable between context-free and everywhere growing DT0L languages.
equivalence problem dt0l language context-free language