Title of article
Easy cases of the D0L sequence equivalence problem
Author/Authors
Juha Honkala، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
6
From page
285
To page
290
Abstract
To test the equivalence of two binary D0L sequences it suffices to compare the first four terms of the sequences. We introduce a larger class of D0L systems for which sequence equivalence can be decided by considering the first ten initial terms.
Keywords
D0L systems , Decidability , Equivalence problem
Journal title
Discrete Applied Mathematics
Serial Year
2001
Journal title
Discrete Applied Mathematics
Record number
885278
Link To Document