. . "P(GA201/00/1031)" . . . "[1F9F382A51F2]" . . . "Dvorsk\u00FD, Ji\u0159\u00ED" . "ITAT 2002" . "RIV/61989100:27240/02:00006706!RIV/2003/GA0/272403/N" . "Malino Brdo, Velk\u00E1 Fatra" . . . "Random access compression methods," . "Ko\u0161ice" . "0"^^ . . "0"^^ . "2"^^ . "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:00006706" . "Sn\u00E1\u0161el, V\u00E1clav" . "Random access compression methods,"@en . "Random access compression methods," . "2"^^ . "17 - 27" . . "data compression, finite automata, direct access compression"@en . . . "UPJ\u0160" . "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 . . . "Random access compression methods,"@en . . "661472" . "11"^^ . . "2002-09-12+02:00"^^ .