On possible growths of arithmetical complexity
RAIRO-Theor. Inf. Appl., 40 3 (2006) 443-458
Published online: 2006-10-18
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):
Combinatorics on Words
Olga G. ParshinaLecture Notes in Computer Science, Combinatorics on Words 10432 121 (2017)
https://doi.org/10.1007/978-3-319-66396-8_12
https://doi.org/10.1002/9781119008200.biblio
https://doi.org/10.1002/9781119042853.biblio
383 (2013)
https://doi.org/10.1109/SYNASC.2013.57
On possible growths of Toeplitz languages
J. Cassaigne, A. E. Frid and F. V. PetrovSiberian Mathematical Journal 52 (1) 63 (2011)
https://doi.org/10.1134/S0037446606010071
Последовательности, близкие к периодическим
Andrei Albertovich Muchnik, Андрей Альбертович Мучник, Юрий Львович Притыкин, et al.Успехи математических наук 64 (5) 21 (2009)
https://doi.org/10.4213/rm9315
On the arithmetical complexity of Sturmian words
J. Cassaigne and A.E. FridTheoretical Computer Science 380 (3) 304 (2007)
https://doi.org/10.1016/j.tcs.2007.03.022
Recent Advances in Formal Languages and Applications
Studies in Computational Intelligence, Recent Advances in Formal Languages and Applications 25 149 (2006)https://doi.org/10.1007/978-3-540-33461-3_6
Sequences of low arithmetical complexity
Sergey V. Avgustinovich, Julien Cassaigne and Anna E. FridRAIRO - Theoretical Informatics and Applications 40 (4) 569 (2006)
https://doi.org/10.1051/ita:2006041