A1 Refereed original research article in a scientific journal
Easy cases of the DOL sequence equivalence problem
Authors: Honkala J
Publisher: ELSEVIER SCIENCE BV
Publication year: 2001
Journal: Discrete Applied Mathematics
Journal name in source: DISCRETE APPLIED MATHEMATICS
Journal acronym: DISCRETE APPL MATH
Volume: 113
Issue: 2-3
First page : 285
Last page: 290
Number of pages: 6
ISSN: 0166-218X
DOI: https://doi.org/10.1016/S0166-218X(01)00187-1
Abstract
To test the equivalence of two binary DOL sequences it suffices to compare the first four terms of the sequences. We introduce a larger class of DOL systems for which sequence equivalence can be decided by considering the first ten initial terms. (C) 2001 Elsevier Science B.V. All rights reserved.
To test the equivalence of two binary DOL sequences it suffices to compare the first four terms of the sequences. We introduce a larger class of DOL systems for which sequence equivalence can be decided by considering the first ten initial terms. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
decidability, DOL systems, equivalence problem
UTU Research Portal