Bounded Pushdown Dimension vs Lempel Ziv Information Density
From MaRDI portal
Publication:2970951
DOI10.1007/978-3-319-50062-1_7zbMath1360.68453arXiv0704.2386WikidataQ60578847 ScholiaQ60578847MaRDI QIDQ2970951
Elvira Mayordomo, Philippe Moser, Pilar Albert
Publication date: 4 April 2017
Published in: Computability and Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0704.2386
finite state (bounded pushdown) dimension; information lossless compressors; Lempel-Ziv compression algorithm
68Q45: Formal languages and automata
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable, Dimension is compression, Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression