Currently displaying 1 – 3 of 3

Showing per page

Order by Relevance | Title | Year of publication

D0L sequence equivalence is in P for fixed alphabets

Keijo Ruohonen — 2008

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

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.

D0L sequence equivalence is in for fixed alphabets

Keijo Ruohonen — 2007

RAIRO - Theoretical Informatics and Applications

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.

Page 1

Download Results (CSV)