Author:
Crochemore Maxime,Lecroq Thierry
Reference18 articles.
1. Blumer A, Blumer J, Ehrenfeucht A, Haussler D, Chen MT, Seiferas J. The smallest automaton recognizing the subwords of a text. Theor Comput Sci. 1985;40(1):31–55.
2. Crochemore M. Transducers and repetitions. Theor Comput Sci. 1986;45(1):63–86.
3. Crochemore M, Hancart C, Lecroq T. Algorithms on strings. Cambridge: Cambridge University Press; 2007.
4. Crochemore M, Vérin R. On compact directed acyclic word graphs. In: Structures in logic et computer science, LNCS, vol. 1261; 1997, p. 192–211.
https://doi.org/10.1007/3-540-63246-8_12
.
5. Farach M. Optimal suffix tree construction with large alphabets. In: Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, Miami Beach; 1997. p. 137–43.