The Prague Stringology Club Workshop 2000

Jiří Dvorský and Václav Snášel

Word-based Compression Method with Direct Access

Compression method (WRAC) based on finite automata is presented in this paper. Simple algorithm for constructing finite automaton for given regular expression is shown. The best advantage of this algorithm is the possibility of random access to a compressed text. The compression ratio achieved is fairly good. The method is independent on source alphabet i.e. algorithm can be character or word based.

Download paper: Article in PostScript Article in PDF
 PostScript   PDF