Easy cases of the DOL sequence equivalence problem



: Honkala J

Publisher: ELSEVIER SCIENCE BV

: 2001

 Discrete Applied Mathematics

: DISCRETE APPLIED MATHEMATICS

: DISCRETE APPL MATH

: 113

: 2-3

: 285

: 290

: 6

: 0166-218X

DOI: https://doi.org/10.1016/S0166-218X(01)00187-1


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.


decidability, DOL systems, equivalence problem



Last updated on 26/11/2024 07:58:16 PM