Displaying similar documents to “Elementary sequences.”

D0L sequence equivalence is in P for fixed alphabets

Keijo Ruohonen (2008)

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

Similarity:

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.

Increasing integer sequences and Goldbach's conjecture

Mauro Torelli (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

Increasing integer sequences include many instances of interesting sequences and combinatorial structures, ranging from tournaments to addition chains, from permutations to sequences having the that any integer greater than 1 can be obtained as the sum of two elements in the sequence. The paper introduces and compares several of these classes of sequences, discussing recurrence relations, enumerative problems and questions concerning shortest sequences.

[unknown]

Pelesko, John A. (2004)

Journal of Integer Sequences [electronic only]

Similarity: