Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Le Gonidec, Marion
2008.
On complexity functions of infinite words associated with generalized Dyck languages.
Theoretical Computer Science,
Vol. 407,
Issue. 1-3,
p.
117.
Cassaigne, Julien
and
Le Gonidec, Marion
2011.
Propriétés et limites de la reconnaissance d’ensembles d’entiers par automates dénombrables.
Journal de théorie des nombres de Bordeaux,
Vol. 22,
Issue. 2,
p.
307.
Le Gonidec, Marion
2012.
On the complexity of a family of k-context-free sequences.
Theoretical Computer Science,
Vol. 414,
Issue. 1,
p.
47.
Caucal, Didier
and
Le Gonidec, Marion
2014.
Theoretical Aspects of Computing – ICTAC 2014.
Vol. 8687,
Issue. ,
p.
259.
Zhang, Jie-Meng
Chen, Jin
Guo, Ying-Jun
and
Wen, Zhi-Xiong
2017.
Morphisms on infinite alphabets, countable states automata and regular sequences.
Chaos, Solitons & Fractals,
Vol. 99,
Issue. ,
p.
263.