Article ID Journal Published Year Pages File Type
10334379 Theoretical Computer Science 2005 11 Pages PDF
Abstract
We show that language equivalence is decidable for HD0L systems having D0L growths. By definition, an HD0L system H has D0L growth if the length sequence of H is a D0L length sequence.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The language equivalence problem for HD0L systems having D0L growths
Authors
,