Content deleted Content added
Deltahedron (talk | contribs) m better |
Deltahedron (talk | contribs) →Related concepts: new section heading |
||
Line 13:
For [[recurrent word]]s, those in which each factor appears infinitely often, the complexity function almost characterises the set of factors: if ''s'' is a recurrent word with the same complexity function as ''t'' are then ''s'' has the same set of factors as ''t'' or δ''t'' where δ denotes the letter doubling morphism ''a'' → ''aa''.<ref name=BLRS84>Berstel et al (2009) p.84</ref>
==Related concepts==
The ''[[topological entropy]]'' of an infinite sequence ''u'' is defined by
| |||