Skip to content
Exact Online String Matching

Simon

Modification of Deterministic-Finite-Automaton. It uses the minimal automaton of the pattern.

Appeared in:

  • [92]: Simon, I.: String matching algorithms and automata. In: Karhum¨aki, J., Maurer, H.A., Rozenberg, G. (eds.) Results and Trends in Theoretical Computer Science, Colloquium in Honor of Arto Salomaa, Graz, Austria, June 10-11, 1994, Proceedings. Lecture Notes in Computer Science, vol. 812, pp. 386–395. Springer (1994), http://dx.doi.org/10.1007/3-540-58131-6_61 ↗