THE SMALLEST AUTOMATION RECOGNIZING THE SUBWORDS OF A TEXT

被引：214

作者：

BLUMER, A

BLUMER, J

HAUSSLER, D

EHRENFEUCHT, A

CHEN, MT

SEIFERAS, J

机构：

[1] UNIV COLORADO, DEPT COMP SCI, BOULDER, CO 80302 USA

[2] NANJING UNIV, DEPT COMP SCI, NANJING, PEOPLES R CHINA

[3] UNIV ROCHESTER, DEPT COMP SCI, ROCHESTER, NY 14627 USA

来源：

THEORETICAL COMPUTER SCIENCE | 1985年 / 40卷 / 01期

关键词：

D O I：

10.1016/0304-3975(85)90157-4

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：31 / 55

页数：25

共 28 条

[1] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].

AHO, AV ;

CORASICK, MJ .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340

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

APOSTOLICO, A ;

PREPARATA, FP .

THEORETICAL COMPUTER SCIENCE, 1983, 22 (03) :297-315

[3]

APOSTOLICO A, 1984, P NATO ADV RES WORKS

[4]

APOSTOLICO A, 1980, ADV CONTROL, P558

[5]

APOSTOLICO A, 1979, PUBLICATION SERIES 3, V176

[6]

BLUMER A, 1983, B EUROP ASS THEORET, V21, P12

[7]

BLUMER A, 1984, 16TH P ACM S THEOR C, P349

[8]

BLUMER J, 1984, MSR8410 U DENV DEP M

[9] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[10]

CHEN MT, 1984, P NATO ADV RES WORKS

← 1 2 3 →