Subject
Computer Science Applications,General Mathematics,Software
Reference18 articles.
1. [An 80] ANGLUIN D., Finding Patterns Common to a Set of Strings, Journal of Computer and Syst. Sci., 1980, 21, pp. 46-62.5898030454.68108
2. [AC 75] AHAO A. and CORACICK M., Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM, 1975.3711720301.68048
3. [AP 83] APOSTOLICO A. and PREPARATA F. P., Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 1983, 22, pp. 297-315.6930620497.68052
4. [B 92] BAKER K., Open problems on avoidable and unavoidable patterns, manuscript (Université de Rouen, France).
5. [C 81] CROCHEMORE M., An optimal algorithm for computing the repetitions in a word, Information Proc. Letters, 1981, 12, pp. 244-250.6328730467.68075