On Two-Dimensional Pattern Matching by Finite Automata
- Cite this paper as:
- Žd’árek J., Melichar B. (2006) On Two-Dimensional Pattern Matching by Finite Automata. In: Farré J., Litovsky I., Schmitz S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg
This paper presents a general concept of two-dimensional pattern matching using conventional (one-dimensional) finite automata. Then two particular models and methods, implementations of the general principle, are presented. The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm. The second introduces a new model for two-dimensional approximate pattern matching using the two-dimensional Hamming distance.
Unable to display preview. Download preview PDF.