Finite Automata Computing Real Functions
SIAM Journal on Computing
Inference algorithms for WFA and image compression
Fractal image compression
Text algorithms
String matching in Lempel-Ziv compressed strings
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Let sleeping files lie: pattern matching in Z-compressed files
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Optimal Two-Dimensional Compressed Matching
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
The complexity of compressing subsegments of images described by finite automata
Discrete Applied Mathematics
Weak bisimulation for (max/+) automata and related models
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
An efficient algorithm for δ-approximate matching with α-bounded gaps in musical sequences
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
The power of weighted finite automata to describe very complex images was widely studied, see [5, 6, 8]. Finite automata can be used as an effective tool for compression of two-dimensional images. There are some software packages using this type of compression, see [6, 13]. We consider the complexity of some pattern-matching problems for two-dimensional images which are highly compressed using finite deterministic and weighted automata as small descriptions of images. Our basic problems are compressed pattern-matching, where the pattern is given explicitly and the text is compressed, and fully compressed pattern-matching (when also the pattern is compressed). We consider also fully compressed pattern-checking: testing of a given occurrence of the compressed pattern in a given position. We prove: 1. Compressed matching for deterministic automata is in P. 2. Compressed matching for weighted automata is NP-complete. 3. Fully compressed pattern-checking for deterministic automata is in P. 4. Fully compressed matching for deterministic automata is NP-complete.