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:

Drunken man infinite words complexity

Marion Le Gonidec

RAIRO-Theor. Inf. Appl., 42 3 (2008) 599-613

Published online: 2008-06-03

DOI: https://doi.org/10.1051/ita:2008012

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 Wen
Chaos, 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 Gonidec
Lecture 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 Gonidec
Theoretical Computer Science 414 (1) 47 (2012)
https://doi.org/10.1016/j.tcs.2011.09.022

On complexity functions of infinite words associated with generalized Dyck languages

Marion Le Gonidec
Theoretical Computer Science 407 (1-3) 117 (2008)
https://doi.org/10.1016/j.tcs.2008.05.015