Author:
Cassaigne Julien,Frid Anna E.,Puzynina Svetlana,Zamboni Luca Q.
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Int. J. Alg. Comput. 15, 149–160 (2005)
2. Cassaigne, J.: Special factors of sequences with linear subword complexity. DLT 1995, 25–34. World Sci. Publishing, Singapore (1996)
3. Cassaigne, J., Nicolas, F.: Factor complexity. Combinatorics, automata and number theory. Encyclopedia Math. Appl., vol. 135, pp. 163–247. Cambridge Univ. Press (2010)
4. Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword complexities of various deterministic developmental languages without interactions. Theoret. Comput. Sci. 1, 59–76 (1975)
5. Frid, A., Puzynina, S., Zamboni, L.Q.: On palindromic factorization of words. Advances in Applied Mathematics 50, 737–748 (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A characterization of words of linear complexity;Proceedings of the American Mathematical Society;2019-04-03
2. Cost and dimension of words of zero topological entropy;Bulletin de la Société mathématique de France;2019
3. On the Values for Factor Complexity;Implementation and Application of Automata;2018
4. On the character of words of sublinear complexity;Acta Arithmetica;2018