| Issue |
RAIRO-Theor. Inf. Appl.
Volume 42, Number 2, April-June 2008
|
|
|---|---|---|
| Page(s) | 361 - 374 | |
| DOI | https://doi.org/10.1051/ita:2007037 | |
| Published online | 13 December 2007 | |
D0L sequence equivalence is in P for fixed alphabets
Institute of Mathematics, Tampere University of Technology,
33101 Tampere, Finland; keijo.ruohonen@tut.fi
Received:
21
August
2006
Accepted:
18
September
2007
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 
-rational sequences.
Mathematics Subject Classification: 68Q45
Key words: D0L system / equivalence problem / polynomial-time algorithm
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.