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.
This research is partially supported by the MŠMT under research program MSM 6840770014.