DETECTING LEFTMOST MAXIMAL PERIODICITIES

被引：80

作者：

MAIN, MG

机构：

来源：

关键词：

D O I：

10.1016/0166-218X(89)90051-6

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：145 / 153

页数：9

共 29 条

[1] OPTIMAL OFF-LINE DETECTION OF REPETITIONS IN A STRING [J].

APOSTOLICO, A ;

PREPARATA, FP .

[2]

AUTEBERT JM, 1980, FORMAL LANGUAGE THEO, P89

[3] AVOIDABLE PATTERNS IN STRINGS OF SYMBOLS [J].

BEAN, DR ;

EHRENFEUCHT, A ;

MCNULTY, GF .

[4] EVERY ITERATED MORPHISM YIELDS A CO-CFL [J].

BERSTEL, J .

[5]

Berstel J., 1979, LECTURE NOTES COMPUT, V71, P16

[6]

BERSTEL J, 1983, LOTHAIRE, pCH2

[7] AN OPTIMAL ALGORITHM FOR COMPUTING THE REPETITIONS IN A WORD [J].

CROCHEMORE, M .

[8]

CROCHEMORE M, 1986, B EATCS, V30, P262

[9]

CROCHEMORE M, 1984, B EATCS, V24, P66

[10]

CROCHEMORE M, 1981, 8053 U PAR LAB INF T