The complexity of compressing subsegments of images described by finite automata

Authors:
Juhani Karhumäki;Wojciech Plandowski;Wojciech Rytter
Affiliations:
Department of Mathematics, Finland and Turku Centre for Computer Science, Turku University, DataCity 4th floor, Turku 20014, Finland;Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097 Warszawa, Poland and Department of Mathematics, Turku University, Finland and Turku Centre for Computer Science, Finland;Instytut Informatyki, Uniwersytet Warszawski Banacha 2, 02-097 Warszawa, Poland and Department of Computer Science, University of Liverpool, Chadwick Building Peach Street, L69 72F Liverpool, UK
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 7
Cited 0

Finite Automata Computing Real Functions

SIAM Journal on Computing
Inference algorithms for WFA and image compression

Fractal image compression
String matching in Lempel-Ziv compressed strings

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Automata, Languages, and Machines

Automata, Languages, and Machines
Pattern-matching problems for two-dimensional images described by finite automata

Nordic Journal of Computing
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts

CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.04

Visualization

Abstract

The scope of certain well-studied polynomial-time solvable classes of Satisfiability is investigated relative to a polynomial-time solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in ...