Sciweavers

ITA
2008
137views Communications» more  ITA 2008»
13 years 4 months ago
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 equival...
Marion Le Gonidec