Author:
Castiglione G.,Restivo A.,Sciortino M.
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. Minimizing local automata;Béal,2007
2. J. Berstel, L. Boasson, O. Carton, Hopcroft’s automaton minimization algorithm and Sturmian words, in: Proceedings of Fifth Colloquium on Mathematics and Computer Science, DMTCS proc., vol. AI, 2008, pp. 355–366
3. On the complexity of Hopcroft’s state minimization algorithm;Berstel,2004
4. Theory of Codes;Berstel,1985
5. On an involution of christoffel words and sturmian morphisms;Berthé;Eur. J. Combin.,2008
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. New string attractor-based complexities for infinite words;Journal of Combinatorial Theory, Series A;2024-11
2. String Attractors and Infinite Words;LATIN 2022: Theoretical Informatics;2022
3. A combinatorial view on string attractors;Theoretical Computer Science;2021-01
4. Novel Results on the Number of Runs of the Burrows-Wheeler-Transform;SOFSEM 2021: Theory and Practice of Computer Science;2021
5. Distinct Squares in Circular Words;String Processing and Information Retrieval;2017