CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Automata on Lempel-ziv Compressed Strings. Export

edited by: Matthias Baaz, Johann A. Makowsky

In CSL 2003, Vol. 2803 (2003), pp. 384-396.

Citation Format

[Posts]

View FullText article


kinaba's tags for this article

automata compression

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

We consider the 'compressed model checking problem': which properties of strings can be determined from a compressed version of the string, without decompression? Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called an LZ-trie. Queries about strings translate to queries about LZ-tries and hence can in principle be answered without decompression. We compare notions of automata accepting LZ-tries and consider the relation between acceptable and monadic-second-order-definable classes of LZ-tries. It turns out that regular properties of strings can be checked efficiently on compressed strings by LZ-trie automata.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.