Optimal superprimitivity testing for strings

Information Processing Letters - Tập 39 Số 1 - Trang 17-20 - 1991
Alberto Apostolico1,2, Martı́n Farach-Colton3, Costas S. Iliopoulos4
1Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA
2Dipartimento di Matematica Pura e Applicata, University of L'Aquila, L'Aquila, Italy
3Department of Computer Science, University of Maryland, College Park, MD 20742 USA
4Department of Computer Science, Royal Holloway College, University of London, Egham, United Kingdom

Tóm tắt

Từ khóa


Tài liệu tham khảo

Apostolico, 1990, Efficient detection of quasiperiodicities in strings, Fibonacci Report 90.6

Apostolico, 1983, Optimal off-line detection of repetitions in a string, Theoret. Comput. Sci., 22, 297, 10.1016/0304-3975(83)90109-3

Lothaire, 1983

Lyndon, 1962, The equation aM = bNcP in a free group, Michigan Math. J., 9, 289, 10.1307/mmj/1028998766

Knuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 323, 10.1137/0206024

Thông tin
Thông tin xuất bản

Information Processing Letters

Tập 39 Số 1

17-20

Thông tin tác giả