Sequences of linear arithmetical complexity
type: Item
instance of: scholarly article
title: Sequences of linear arithmetical complexity
zbMATH Open document ID: 1076.68053
published in: Theoretical Computer Science
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 2184112
zbMATH Keywords: Arithmetical complexity
zbMATH Keywords: Infinite word
zbMATH Keywords: Subword complexity
zbMATH Keywords: Toeplitz word
zbMATH Keywords: Uniformly recurrent word
zbMATH Keywords: Special words
zbMATH Keywords: \(S\)-adic conjecture
author: Anna Frid
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.01.009
OpenAlex ID: W2056306675
cites work: The ring of \(k\)-regular sequences
cites work: Sequences of low arithmetical complexity
cites work: Complexity and special factors
cites work: Toeplitz words, generalized periodicity and periodically iterated morphisms
cites work: Local symmetries in the period-doubling sequence
cites work: Subword complexities of various classes of deterministic developmental languages without interactions
cites work: Complexity of sequences and dynamical systems
cites work: Arithmetical complexity of symmetric D0L words.
cites work: Q3814828
cites work: Sequence entropy and the maximal pattern complexity of infinite words
cites work: Complexity of Toeplitz sequences
cites work: Q4738292
DOI: 10.1016/J.TCS.2005.01.009
description: scientific article; zbMATH DE number 2184112