Data compression with factor automata

DOI10.1016/0304-3975(92)90144-5zbMath0747.68027OpenAlexW2017880521WikidataQ128201243 ScholiaQ128201243MaRDI QIDQ1190467

Marc Zipstein

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90144-5

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Theory of data (68P99) Prefix, length-variable, comma-free codes (94A45)

Related Items (2)

Practical and flexible pattern matching over Ziv-Lempel compressed text. ⋮ Compror: On-line lossless data compression with a factor oracle.

Cites Work

• A Mathematical Theory of Communication
• The smallest automaton recognizing the subwords of a text
• Transducers and repetitions
• Linear Algorithm for Data Compression via String Matching
• On the Complexity of Finite Sequences
• Compression of individual sequences via variable-rate coding
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Data compression with factor automata