zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Factor complexity. (English) Zbl 1216.68204
Berthé, Valérie (ed.) et al., Combinatorics, automata, and number theory. Cambridge: Cambridge University Press (ISBN 978-0-521-51597-9/hbk). Encyclopedia of Mathematics and its Applications 135, 163-217 (2010).
Introduction: Given an infinite word, we can study the language of its finite factors. Intuitively, we expect that `simple’ words (because they are generated by simple devices, or have some regularity property) will also have a `simple’ language of factors. One way to quantify this is to just count factors of each length. In doing so, we associate a function with the infinite word considered: its factor complexity function. This function was introduced in 1938 by {\it G. A. Hedlund} and {\it M. Morse} [Am. J. Math. 60, 815--866 (1938; Zbl 0019.33502)] under the name block growth as a tool to study symbolic dynamical systems. The name subword complexity was given in 1975 by Andrzej Ehrenfeucht, Kwok Pun Lee and Grzegorz Rozenberg. Here we use, factor complexity for consistence with the use of factor. Factor complexity should not be confused with other notions of complexity, like algorithmic complexity or Kolmogorov complexity. We shall not use them here, and by `complexity’ we always mean `factor complexity’. For the entire collection see [Zbl 1197.68006].

68R15Combinatorics on words
11B83Special sequences of integers and polynomials
Full Text: DOI