The smallest automation recognizing the subwords of a text
- 31 December 1985
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 40, 31-55
- https://doi.org/10.1016/0304-3975(85)90157-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- Detection of periodicities and string-matching in real timeJournal of Mathematical Sciences, 1983
- A method for detecting structure in polygonsPattern Recognition, 1981
- Linear Algorithm for Data Compression via String MatchingJournal of the ACM, 1981
- Efficient On-Line Construction and Correction of Position TreesSIAM Journal on Computing, 1980
- 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
- PATRICIA—Practical Algorithm To Retrieve Information Coded in AlphanumericJournal of the ACM, 1968