Transducers and repetitions
- 1 January 1986
- journal article
- review article
- Published by Elsevier in Theoretical Computer Science
- Vol. 45 (1) , 63-86
- https://doi.org/10.1016/0304-3975(86)90041-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- A fast test for unique decipherability based on suffix trees (Corresp.)IEEE Transactions on Information Theory, 1982
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975