Article contents
Three complexity functions
Published online by Cambridge University Press: 23 November 2011
Abstract
For an extensive range of infinite words, and the associated symbolic dynamical systems, we compute, together with the usual language complexity function counting the finite words, the minimal and maximal complexity functions we get by replacing finite words by finite patterns, or words with holes.
- Type
- Research Article
- Information
- Copyright
- © EDP Sciences 2011
References
- 1
- Cited by