Skip to main content Accessibility help
×
Home
Hostname: page-component-768ffcd9cc-q6bj7 Total loading time: 0.18 Render date: 2022-12-01T09:44:30.093Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "displayNetworkTab": true, "displayNetworkMapGraph": false, "useSa": true } hasContentIssue true

Drunken man infinite words complexity

Published online by Cambridge University Press:  03 June 2008

Marion Le Gonidec*
Affiliation:
Institut de Mathématiques, Université de Liège, Grande traverse 12 B.37, 4000 Liège, Belgium; M.LeGonidec@ulg.ac.be
Get access

Abstract

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(log2n)2 when n goes to infinity.


Keywords

Type
Research Article
Copyright
© EDP Sciences, 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Allouche, J.-P., Sur la complexité des suites infinies. Bull. Belg. Math. Soc. Simon Stevin 1 (1994) 133143.
J.-P. Allouche and J. Shallit, Automatic sequences. Theory, applications, generalizations. Cambridge University Press (2003).
J. Cassaigne, Special factors of sequences with linear subword complexity. In Developments in language theory (Magdeburg, 1995), World Sci. Publishing (1996) 25–34.
Cassaigne, J., Complexité et facteurs spéciaux. Bull. Belg. Math. Soc. Simon Stevin 4 (1997) 6788.
Cobham, A., Uniform-tag sequences. Math. Syst. Theory 6 (1972) 164192. CrossRef
Ferenczi, S., Complexity of sequences and dynamical systems. Discrete Math. 206 (1999) 145154. CrossRef
Ferenczi, S., Substitution dynamical systems on infinite alphabets. Ann. Inst. Fourier 56 (2006) 23152343. CrossRef
Fouvry, E. and Mauduit, C., Sur les entiers dont la somme des chiffres est moyenne. J. Number Theory 114 (2005) 135152. CrossRef
P. Kůrka, Topological and symbolic dynamics, Cours spécialisés Vol. 11, SMF (2003).
Le Gonidec, M., Sur la complexité de mots infinis engendrés par des q-automates dénombrables. Ann. Inst. Fourier 56 (2006) 24632491. CrossRef
M. Le Gonidec, Sur la complexité des mots q -automatiques. Ph.D. thesis, Université Aix-Marseille II (2006).
Mauduit, C., Propriétés arithmétiques des substitutions et automates infinis. Ann. Inst. Fourier 56 (2006) 25252549. CrossRef
Mauduit, C. and Sárközy, A., On the arithmetic structure of sets characterized by sum of digits properties. J. Number Theory 61 (1996) 2538. CrossRef
Pansiot, J.-J., Complexité des facteurs des mots infinis engendrés par morphismes itérés. Lecture Notes Comput. Sci. 172 (1985) 380389. Automata, languages and programming (Antwerp, 1984). CrossRef
L. Staiger, Kolmogorov complexity of infinite words. CDMTCS Research Report Series 279 (2006).

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Drunken man infinite words complexity
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Drunken man infinite words complexity
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Drunken man infinite words complexity
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *