Article contents
D0L sequence equivalence is in P for fixed alphabets
Published online by Cambridge University Press: 13 December 2007
Abstract
A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of $\mathbb{Z}$-rational sequences.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences, 2007
References
- 3
- Cited by