Title of article
On the equivalence problem of context-free and DT0L languages
Author/Authors
Juha Honkala، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
3
From page
147
To page
149
Abstract
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.
Keywords
DT0L language , Equivalence problem , Context-free language
Journal title
Discrete Applied Mathematics
Serial Year
1999
Journal title
Discrete Applied Mathematics
Record number
884998
Link To Document