Free Access
RAIRO-Theor. Inf. Appl.
Volume 31, Number 1, 1997
Page(s) 1 - 14
Published online 01 February 2017
  1. [An 80] D. ANGLUIN, Finding Patterns Common to a Set of Strings, Journal of Computer and Syst. Sci., 1980, 21, pp. 46-62. [MR: 589803] [Zbl: 0454.68108] [Google Scholar]
  2. [AC 75] A. AHAO and M. CORACICK, Efficient String Matching: An Aid to Bibliographic Search, Comm. ACM, 1975. [MR: 371172] [Zbl: 0301.68048] [Google Scholar]
  3. [AP 83] A. APOSTOLICO and F. P. PREPARATA, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 1983, 22, pp. 297-315. [MR: 693062] [Zbl: 0497.68052] [Google Scholar]
  4. [B 92] K. BAKER, Open problems on avoidable and unavoidable patterns, manuscript (Université de Rouen, France). [Google Scholar]
  5. [C 81] M. CROCHEMORE, An optimal algorithm for computing the repetitions in a word, Information Proc. Letters, 1981, 12, pp. 244-250. [MR: 632873] [Zbl: 0467.68075] [Google Scholar]
  6. [CN 89] M. CROCHEMORE and J. NÉRAUD, Unitary monoid with two generators: an algorithmic point of view, in: Proceedings of CAAP'90, 1990. [MR: 1075026] [Zbl: 0758.68053] [Google Scholar]
  7. [CLR 90] T. TCORMEN, C. LEISERSON and R. RIVEST, "Introduction to Algorithm", The MIT Press, 1990 [Zbl: 1158.68538] [Google Scholar]
  8. [CR 91] M. CROCHEMORE and W. RYTTER, Periodic prefixes of string, in: Acts of Sequences '91, 1991. [Google Scholar]
  9. [CR 94] M. CROCHEMORE and W. RYTTER, "Text Algoriths", Oxford University Press, 1994. [MR: 1307378] [Zbl: 0844.68101] [Google Scholar]
  10. [GS 83] Z. GALIL and J. SEIFERAS, Saving space in fast string-matching, SIAM J. Comput., 1980, pp. 417-438. [MR: 568822] [Zbl: 0446.68041] [Google Scholar]
  11. [JSSY 95] TAO JIANG, A. SALOMAA, K. SALOMAA and SHENG YU, Decision problems for patters, Journ. of Comput. Syst. Sci., 1995, 50(1), pp. 53-63. [MR: 1322633] [Zbl: 0827.68066] [Google Scholar]
  12. [K 73] D. KNUTH, "Sorting and Searching", vol. 3, of "The Art of Computer Programming". Addison Wesley 1969, Second edition, 1981. [Zbl: 0883.68015] [Google Scholar]
  13. [KMP 77] D. KNUTH, J. MORRIS and V. PRATT, Fast pattern matching in string, SIAM J. Comput., 1977, 6, No. 2, pp. 323-350. [MR: 451916] [Zbl: 0372.68005] [Google Scholar]
  14. [Lo 83] M. LOTHAIRE, "Compbinatorics on words", Encyclopedia of Mathematics and appl., Addison Wesley Publish. Company, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  15. [ML 85] G. MAIN and J. LORENTZ, Linear time recognition of squarefree string, in "Combinatoric Algorithms on Words", A. Apostolica and Z. Galil eds., NATO ASI, Springer Verlag, Berlin, 1985 (1), pp. 5-37 [MR: 815345] [Zbl: 0572.68068] [Google Scholar]
  16. [N 95] J. NÉRAUD, Algorithms for detecting morphic images of a word, Info. and Comput., 1995,120, No. 1, pp. 126-148. [MR: 1340812] [Zbl: 0835.68091] [Google Scholar]
  17. [N 95.1] J. NÉRAUD, Detecting morphic images of a word: On the rank of a pattern, Acta Info., 1994. [MR: 1348438] [Zbl: 0843.68106] [Google Scholar]
  18. [R 85] O. RABIN, Discovering repetitions in string, in "Combinatoric Algorithms on Words", A. Apostolico and Z. Galil eds., NATO ASI, Springer Verlag, Berlin, 1985. [MR: 815327] [Zbl: 0604.68074] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.