Drunken man infinite words complexity
RAIRO-Theor. Inf. Appl., 42 3 (2008) 599-613
Published online: 2008-06-03
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Morphisms on infinite alphabets, countable states automata and regular sequences
Jie-Meng Zhang, Jin Chen, Ying-Jun Guo and Zhi-Xiong WenChaos, Solitons & Fractals 99 263 (2017)
https://doi.org/10.1016/j.chaos.2017.04.018
Theoretical Aspects of Computing – ICTAC 2014
Didier Caucal and Marion Le GonidecLecture Notes in Computer Science, Theoretical Aspects of Computing – ICTAC 2014 8687 259 (2014)
https://doi.org/10.1007/978-3-319-10882-7_16
On the complexity of a family of k-context-free sequences
Marion Le GonidecTheoretical Computer Science 414 (1) 47 (2012)
https://doi.org/10.1016/j.tcs.2011.09.022
Propriétés et limites de la reconnaissance d’ensembles d’entiers par automates dénombrables
Julien Cassaigne and Marion Le GonidecJournal de théorie des nombres de Bordeaux 22 (2) 307 (2011)
https://doi.org/10.5802/jtnb.717
On complexity functions of infinite words associated with generalized Dyck languages
Marion Le GonidecTheoretical Computer Science 407 (1-3) 117 (2008)
https://doi.org/10.1016/j.tcs.2008.05.015