On two-dimensional pattern matching by finite automata

Authors:
Jan Žd'árek;Bořivoj Melichar
Affiliations:
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Praha 2, Czech Republic;Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Praha 2, Czech Republic
Venue:
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Year:
2005

Citing 6
Cited 0

Fast text searching: allowing errors

Communications of the ACM
Automata for matching patterns

Handbook of formal languages, vol. 2
Two-dimensional languages

Handbook of formal languages, vol. 3
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Approximate String Matching by Finite Automata

CAIP '95 Proceedings of the 6th International Conference on Computer Analysis of Images and Patterns

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.