SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 40, Issue C, 1985, Pages 31-55

The smallest automation recognizing the subwords of a text

(6) Blumer, A a Blumer, J a Haussler, D a Ehrenfeucht, A b Chen, M T c Seiferas, J d

a UNIVERSITY OF DENVER (United States)

b UNIVERSITY OF COLORADO (United States)

c NANJING UNIVERSITY (China)

d UNIVERSITY OF ROCHESTER (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

DETERMINISTIC FINITE AUTOMATA; SUBWORD RECOGNITION;

AUTOMATA THEORY;

EID: 0021483058 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(85)90157-4 Document Type: Article

Times cited : (277)

References (29)

1
- 0016518897
- Efficient string matching: An aid to bibliographic research
- (1975) Comm. ACM , vol.18 , Issue.6 , pp. 333-340
- Aho¹ Corasick²

2
- 84919093539
- Some linear time algorithms for string statistics problems
- IAC, Rome
- (1979) Publication Series III , vol.176
- Apostolico¹

3
- 84915628615
- Fast applications of suffix trees
- D.G. Lainiotis, N.S. Tzannes, Reidel, Hingham, MA
- (1980) Advances in Control , pp. 558-567
- Apostolico¹

4
- 49049125709
- Optimal off-line detection of repetitions in a string
- (1983) Theoret. Comput. Sci. , vol.22 , pp. 297-315
- Apostolico¹ Preparata²

5
- 0002139526
- The myriad virtues of suffix trees
- Maratea, Italy
- (1984) Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words
- Apostolico¹

6
- 18544382372
- Linear size finite automata for the set of all subwords of a word: An outline of results
- (1983) Bull. Europ. Assoc. Theoret. Comput. Sci. , vol.21 , pp. 12-20
- Blumer¹ Blumer² Ehrenfeucht³ Haussler⁴ McConnell⁵

7
- 84945709864
- Building a complete inverted file for a set of text files in linear time
- (1984) Proc. 16th ACM Symp. on Theory of Computing , pp. 349-358
- Blumer¹ Blumer² Ehrenfeucht³ Haussler⁴ McConnell⁵

8
- 84919093537
- Correctness and linearity of the on-line directed acyclic word graph algorithm
- Univ. of Denver, Dept. of Mathematics and Computer Science
- (1984) Tech. Rept. MS-R-8410
- Blumer¹

9
- 0017547820
- A fast string searching algorithm
- (1977) Comm. ACM , vol.20 , Issue.10 , pp. 762-772
- Boyer¹ Moore²

10
- 84913362391
- C.S. and C.E. Res. Rev., Univ. of Rochester
- (1983) Efficient and elegant subword-tree construction , pp. 10-14
- Chen¹ Seiferas²

11
- 0001884405
- Efficient and elegant subword-tree construction
- Maratea, Italy
- (1984) Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words
- Chen¹ Seiferas²

12
- 70749151045
- Optimal factor transducers
- Maratea, Italy
- (1984) Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words
- Crochemore¹

13
- 84919093536
- Linear searching for a square in a word
- Presented at, Antwerp, Belgium
- (1984) 11th Internat. Colloq. on Automata, Languages, and Programming
- Crochemore¹

14
- 84919093535
- M. Crochemore, Personal communication, 1984.

15
- 0003620778
- Addison-Wesley, Reading, MA
- (1979) Introduction to Automata Theory, Languages, and Computation
- Hopcroft¹ Ullman²

16
- 0000904908
- Fast pattern matching in strings
- (1977) SIAM Journal on Computing , vol.6 , Issue.2 , pp. 323-350
- Knuth¹ Morris² Pratt³

17
- 0347630054
- Efficient on-line construction and correction of position trees
- (1980) SIAM Journal on Computing , vol.9 , Issue.4 , pp. 785-807
- Majster¹ Reiser²

18
- 0016942292
- A space-economical suffix tree construction algorithm
- (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 262-272
- CcCreight¹

19
- 38149018071
- PATRICIA—practical algorithm to retrieve information coded in alphanumeric
- (1968) Journal of the ACM , vol.15 , Issue.4 , pp. 514-534
- Morrison¹

20
- 84968499135
- Linear automaton transformation
- (1958) Proceedings of the American Mathematical Society , vol.9 , pp. 541-544
- Nerode¹

21
- 0542386122
- Unpublished manuscript
- (1975) Improvements and applications for the Weiner repetition finder
- Pratt¹

22
- 0347494019
- Linear algorithm for data compression via string matching
- (1981) Journal of the ACM , vol.28 , Issue.1 , pp. 16-24
- Rodeh¹ Pratt² Even³

23
- 84919093534
- String-matching in real time
- The Steklov Institute of Mathematics, Leningrad Branch, (in Russian)
- (1977) Preprint P-7-77
- Slisenko¹

24
- 4243561050
- String matching in real time: Some properties of the data structure
- Lecture Notes in Computer Science, Springer, Berlin
- (1978) Proc. 7th Symp. on Mathematical Foundations of Computer Science , vol.64 , pp. 493-496
- Slisenko¹

25
- 84884344567
- Determination in real time of all the periodicities in a word
- (1980) Sov. Math. Dokl. , vol.21 , Issue.2 , pp. 392-395
- Slisenko¹

26
- 0038780616
- Detection of periodicities and string matching in real time
- (1983) J. Sov. Math. , vol.22 , Issue.3 , pp. 1316-1387
- Slisenko¹

27
- 84919075488
- Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im
- translated from
- (1980) V.A. Steklov AN SSSR , vol.105 , pp. 62-173
- Slisenko¹

28
- 0019728213
- A method for detecting structure in polygons
- (1981) Pattern Recognition , vol.13 , Issue.6 , pp. 389-394
- Tanimoto¹

29
- 85043482370
- Linear pattern matching algorithms
- (1973) IEEE 14th Ann. Symp. on Switching and Automata Theory , pp. 1-11
- Weiner¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.