Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

Sequences of low arithmetical complexity

Sergey V. Avgustinovich; Julien Cassaigne; Anna E. Frid — 2006

RAIRO - Theoretical Informatics and Applications

Arithmetical complexity of a sequence is the number of words of length that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical complexity and describe the family of such words having lowest complexity.

Page 1

Download Results (CSV)