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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 45, Issue C, 1986, Pages 63-86

Transducers and repetitions

(1) Crochemore, Maxime a

a UNIVERSITÉ PARIS 13 (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

FACTOR AUTOMATA; FACTOR TRANSDUCERS;

AUTOMATA THEORY;

EID: 0022865420 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(86)90041-1 Document Type: Review

Times cited : (183)

References (20)

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

2
- 0003415652
- Addison-Wesley, Reading, MA
- (1974) The Design and Analysis of Computer Algorithms
- Aho¹ Hopcroft² Ullman³

3
- 0004209335
- Addison-Wesley, Reading, MA
- (1979) Principles of Compiler Design
- Aho¹ Ullman²

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

5
- 0003601314
- Teubner, Stuttgart
- (1979) Transduction and Context-Free Languages
- Berstel¹

6
- 0021483058
- The smallest automation recognizing the subwords of a text
- (1985) Theoret. Comput. Sci. , vol.40 , Issue.1 , pp. 31-56
- Blumer¹ Blumer² Ehrenfeucht³ Haussler⁴ Chen⁵ Seiferas⁶

7
- 18544382372
- 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⁵

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

9
- 0038442820
- Recherche linéaire d'un carré dans un mot
- série I
- (1983) C.R. Acad. Sci., Paris , vol.296 , pp. 781-784
- Crochemore¹

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

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

12
- 0004157169
- Addison-Wesley, Reading, MA
- (1983) Combinatorics on Words
- Lothaire¹

13
- 37849054123
- An O(n log n) algorithm for finding repetition in a string
- Washington State Univ, Pullman
- (1979) Tech. Rept. CS-79-056
- Main¹ Lorentz²

14
- 0006886838
- Linear time recognition of square-free strings
- Maratea, Italy
- (1984) Proc. NATO Advanced Research Workshop on Combinatorial Algorithms on Words , pp. 271-278
- Main¹ Lorentz²

15
- 0016942292
- A space-economical suffix-tree construction algorithm
- (1976) J. ACM , vol.23 , Issue.2 , pp. 262-272
- McCreight¹

16
- 0004722024
- A linear pattern-matching algorithm
- Comput. Center, Univ. of California, Berkeley
- (1970) Tech. Rept. 40
- Morris¹ Pratt²

17
- 0020154201
- A fast test for unique decipherability based on suffix-tree
- (1982) IEEE Transactions on Information Theory , vol.28 IT , Issue.4 , pp. 648-651
- Rodeh¹

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

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

20
- 0018019231
- Compression of individual sequences via variable-rate coding
- (1978) IEEE Transactions on Information Theory , vol.24 IT , Issue.5 , pp. 530-536
- Ziv¹ Lempel²

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