Three complexity functions
Work
Year: 2011
Type: article
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 max... more
Authors Sébastien Ferenczi, Pascal Hubert
Cites: 20
Cited by: 3
Related to: 10
FWCI: 0.553
Citation percentile (by year/subfield): 56.66
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green