Random access compression methods,

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F02%3A00006706" target="_blank" >RIV/61989100:27240/02:00006706 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Random access compression methods,

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

JC - Computer hardware and software

OECD FORD branch

—

Project

<a href="/en/project/GA201%2F00%2F1031" target="_blank" >GA201/00/1031: Intelligent retrieval in document information systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

ITAT 2002

ISBN

—

ISSN

—

e-ISSN

—

Number of pages

11

Pages from-to

17-27

Publisher name

UPJŠ

Place of publication

Košice

Event location

Malino Brdo, Velká Fatra

Event date

Sep 12, 2002

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

—