What it is
We describe an asymptotic solution to the inverse problem, realizing every function satisfying two necessary conditions as the complexity function of an infinite word up to asymptotic equivalence. We then turn to phenomena beyond asymptotic equivalence, presenting constructions of infinite words with seemingly contradictory behavior of the discrete derivatives of their complexity functions.
Every metric behind this entry is listed, with its source, under Sources and data below.
Filed undersemigroups and automata theory, Mathematical Dynamics and Fractals, Algorithms and Data Compression