Word Random Access Compression

  • Authors:

  • Jiri Dvorský;Václav Snásel

  • Affiliations:

  • -;-

  • Venue:
  • CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Compression method (WRAC) based on finite automatons is presented in this paper. Simple algorithm for construction 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.