"Compression methods based on finite automatons are presented in this paper. Simple algorithm for construction finite automaton for given regular expression is shown. The best advantage of this algorithms is the possibility of random access to a compressed text. The compression ratio achieved is fairly good. The methods are independent on source alphabet i.e. algorithms can be character or word based." . "RIV/61989100:27240/02:00006707" . . "Universidad de Malaga" . "27240" . . "Compression methods based on finite automatons are presented in this paper. Simple algorithm for construction finite automaton for given regular expression is shown. The best advantage of this algorithms is the possibility of random access to a compressed text. The compression ratio achieved is fairly good. The methods are independent on source alphabet i.e. algorithms can be character or word based."@en . "Malaga" . "699-8194-3" . . "Two methods for random access compression." . "Two methods for random access compression."@en . "Two methods for random access compression." . . "0"^^ . "[45BC8A562CC2]" . "RIV/61989100:27240/02:00006707!RIV/2003/GA0/272403/N" . "2"^^ . "0"^^ . "Sn\u00E1\u0161el, V\u00E1clav" . . "2"^^ . . . . . . "P(GA201/00/1031)" . . "1"^^ . "667564" . . "Dvorsk\u00FD, Ji\u0159\u00ED" . "Malaga, Spain" . . "Two methods for random access compression."@en . . "data compression, finite automata, direct access compression"@en . "AH'2002, Proceedings of the Workshop on Document Compression and Synthesis in Adaptive Hypermedia Systems" . "2002-01-01+01:00"^^ . . "10" . . .