Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Orbit complexity and data compression
Autore:
Galatolo, S;
Indirizzi:
Univ Pisa, Dipartimento Matemat, I-56127 Pisa, Italy Univ Pisa Pisa Italy I-56127 , Dipartimento Matemat, I-56127 Pisa, Italy
Titolo Testata:
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS
fascicolo: 3, volume: 7, anno: 2001,
pagine: 477 - 486
SICI:
1078-0947(200107)7:3<477:OCADC>2.0.ZU;2-#
Fonte:
ISI
Lingua:
ENG
Soggetto:
ALGORITHMIC COMPLEXITY; DYNAMICAL-SYSTEMS; DNA-SEQUENCES;
Keywords:
topological dynamical systems; information; coding; entropy; orbit complexity;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Physical, Chemical & Earth Sciences
Citazioni:
18
Recensione:
Indirizzi per estratti:
Indirizzo: Galatolo, S Univ Pisa, Dipartimento Matemat, Via Buonarroti 2, I-56127 Pisa, Italy Univ Pisa Via Buonarroti 2 Pisa Italy I-56127 127 Pisa, Italy
Citazione:
S. Galatolo, "Orbit complexity and data compression", DISCR C D S, 7(3), 2001, pp. 477-486

Abstract

We consider data compression algorithms as a tool to get an approximate measure for the quantity of information contained in a string. By this it is possible to give a notion of orbit complexity for topological dynamical systems. In compact ergodic dynamical systems, entropy is almost everywhere equal to orbit complexity. The use of compression algorithms allows a direct estimation of the information content of the orbits.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 24/01/20 alle ore 13:05:46