A1 Refereed original research article in a scientific journal
On the equivalence problem of context-free and DT0L languages
Authors: Honkala J
Publisher: ELSEVIER SCIENCE BV
Publication year: 1999
Journal: Discrete Applied Mathematics
Journal name in source: DISCRETE APPLIED MATHEMATICS
Journal acronym: DISCRETE APPL MATH
Volume: 98
Issue: 1-2
First page : 147
Last page: 149
Number of pages: 3
ISSN: 0166-218X
DOI: https://doi.org/10.1016/S0166-218X(99)00120-1
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. (C) 1999 Elsevier Science B.V. All rights reserved.
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. (C) 1999 Elsevier Science B.V. All rights reserved.
UTU Research Portal