Sequences of low arithmetical complexity
Work
Year: 2006
Type: article
Abstract: Arithmetical complexity of a sequence is the number of words of length n that can be extracted from it according to arithmetic progressions. We study uniformly recurrent words of low arithmetical comp... more
Cites: 18
Cited by: 22
Related to: 10
FWCI: 1.516
Citation percentile (by year/subfield): 84.34
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green