论文信息 - Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time

Let a partial deterministic finite automaton be a DFA in which each state need not have a transition edge for each letter of the alphabet. We demonstrate that the minimal partial DFA for the set of all subwords of a given word w, |w| > 2, has at most 2|w| − 2 states and 3|w| − 4 transition edges, independently of the alphabet size. We give an algorithm to build this minimal partial DFA from the input w on-line in linear time.

David Haussler | Andrzej Ehrenfeucht | Ross M. McConnell | Anselm Blumer | J. Blumer

[1] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[2] Peter Weiner,et al. Linear Pattern Matching Algorithms , 1973, SWAT.

[3] Edward M. McCreight,et al. A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[4] Robert S. Boyer,et al. A fast string searching algorithm , 1977, CACM.

[5] Donald R. Morrison,et al. PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[6] Franco P. Preparata,et al. Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..

[7] Alfred V. Aho,et al. Efficient string matching , 1975, Commun. ACM.

[8] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[9] J. Seiferas,et al. Efficient and Elegant Subword-Tree Construction , 1985 .

[10] Michael Rodeh,et al. Linear Algorithm for Data Compression via String Matching , 1981, JACM.

[11] Mila E. Majster. Efficient On-Line Construction and Correction of Position Trees , 1980 .

[12] A. O. Slisenko,et al. Detection of periodicities and string-matching in real time , 1983 .

[13] David Haussler,et al. Linear size finite automata for the set of all subwords of a word - an outline of results , 1983, Bull. EATCS.

[14] David Haussler,et al. Building a complete inverted file for a set of text files in linear time , 1984, STOC '84.