Drunken man infinite words complexity

In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equivalently generated by a substitution over a countable alphabet of constant length, have complexity functions equivalent to n(log2 n)2 when n goes to infinity. 1991 Mathematics Subject Classification. 11B85,68R15.

• Type: Journal
• Year: 2008
• Where: ITA
• Authors: Marion Le Gonidec
• Keywords: Communications, Complete Countable Automaton, Countable Alphabet, Infinite Words, ITA 2008