1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading,Mass., 1974; Mir, Moscow, 1979).
2. E. Kh. Gimadi, A. V. Kelmanov, M. A. Kelmanova, and S. A. Khamidullin, “A posteriori Detection of a Quasiperiodically Repeating Fragment with Given Number of Repetitions in a Numerical Sequence” Sibirsk. Zh. Industr. Mat. 9 (1(25)), 55–74 (2006).
3. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979; Mir, Moscow, 1982).
4. A. V. Kelmanov, S. A. Khamidullin, and L. A. Okolnishnikova, “A posteriori Detection of Identical the Same Subsequences in a Quasiperiodic Sequence,” Sibirsk. Zh. Industr. Mat. 5 (2(10)), 94–108 (2002).