Building the minimal DFA for the set of all subwords of a word on-line in linear time
- 1 January 1984
- book chapter
- Published by Springer Nature
- p. 109-118
- https://doi.org/10.1007/3-540-13345-3_9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Building a complete inverted file for a set of text files in linear timePublished by Association for Computing Machinery (ACM) ,1984
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- 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
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959