2
|
Abstract:
Abstract. A compression algorithm takes a finite structure of a class K as input and produces a finite structure of a different class K ' as output. Given a property P on the class K defined in a logic L, we study the definability of property P on the class K'. We consider two compression schemas on unary ordered structures (words), a naive compression and the classical Lempel-Ziv. First-order properties of strings are first-order on naively compressed strings, but this fails for images, i.e. 2-dimensional strings. We present simple first-order properties of strings which are not first-order definable on strings compressed with the Lempel-Ziv compression schema. We show that all properties of strings that are first-order definable on strings are definable on Lempel-Ziv compressed strings in FO(TC), the extension of first-order logic with the transitive closure operator. We define a subclass C of the first-order properties of strings such that if L is defined by a property in C, it is also first-order definable on the Lempel-Ziv compressed strings. 1
Citations
| 4363 | Elements of Information Theory – Cover, Thomas - 1991 |
| 378 | Finite Model Theory – Ebbinghaus, Flum - 1995 |
| 241 | On a decision method in restricted second order arithmetic – Büchi - 1962 |
| 69 | String matching in Lempel-Ziv compressed strings – Farach, Thorup - 1998 |
| 36 | Decision problems of finite automata design and related arithmetics – Elgot - 1961 |
| 12 | Pattern matching in text compressed by using antidictionaries – Shibata, Takeda, et al. - 1999 |
| 8 | Elementary computability, formal languages, and automata – McNaughton - 1982 |
