Author:
Goč Daniel,Saari Kalle,Shallit Jeffrey
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Allouche, J.-P., Rampersad, N., Shallit, J.: Periodicity, repetitions, and orbits of an automatic sequence. Theoret. Comput. Sci. 410, 2795–2803 (2009)
2. Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)
3. Allouche, J.-P., Shallit, J.O.: The ring of k-regular sequences. Theoret. Comput. Sci. 98, 163–197 (1992)
4. Černý, A.: Lyndon factorization of generalized words of Thue. Discrete Math. & Theoret. Comput. Sci. 5, 17–46 (2002)
5. Lecture Notes in Computer Science;É. Charlier,2011
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. TRANSFINITE LYNDON WORDS;LOG METH COMPUT SCI;2020
2. Additive Number Theory via Automata Theory;Theory of Computing Systems;2019-05-29
3. Decision algorithms for Fibonacci-automatic Words, I: Basic results;RAIRO - Theoretical Informatics and Applications;2016-01
4. Mechanical Proofs of Properties of the Tribonacci Word;Lecture Notes in Computer Science;2015
5. Lyndon words and Fibonacci numbers;Journal of Combinatorial Theory, Series A;2014-01