论文信息 - Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality

Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality

We present an algorithm for constructing the minimal automaton recognizing A*X, where the pattern X is a set of m (that is a fixed integer) non-empty words over a finite alphabet A whose sum of lengths is n. This algorithm, inspired by Brzozowski's minimization algorithm, uses sparse lists to achieve a linear time complexity with respect to n.

Frédérique Bassino | Cyril Nicaud | Omar AitMous

[1] John E. Hopcroft,et al. An n log n algorithm for minimizing states in a finite automaton , 1971 .

[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[3] J. Brzozowski. Canonical regular expressions and minimal state graphs for definite events , 1962 .

[4] Maxime Crochemore,et al. Minimizing local automata , 2007, 2007 IEEE International Symposium on Information Theory.

[5] J. M. Foster,et al. Mathematical theory of automata , 1965 .

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

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

[8] M. Crochemore,et al. Algorithms on Strings: Tools , 2007 .

[9] Wojciech Rytter,et al. Jewels of stringology , 2002 .

[10] Maxime Crochemore,et al. Algorithms on strings , 2007 .

[11] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[12] Mehryar Mohri,et al. String-Matching with Automata , 1997, Nord. J. Comput..

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