On encoding and decoding with two-way head machines

DOI10.1006/INCO.1995.1009zbMath0823.68054OpenAlexW2013819276MaRDI QIDQ1346720

Jacob Ziv, Abraham Lempel, Dafna Sheinwald

Publication date: 10 April 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1995.1009

zbMATH Keywords

decodersfinite state sequential machinessequential encoders

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Automatic Kolmogorov complexity, normality, and finite-state dimension revisited ⋮ A worst-case analysis of the LZ2 compression algorithm ⋮ Bounded Pushdown Dimension vs Lempel Ziv Information Density ⋮ On-line versus off-line computation in dynamic text compression ⋮ Pushdown dimension ⋮ Pebble-depth ⋮ Deterministic pushdown automata can compress some normal sequences

This page was built for publication: On encoding and decoding with two-way head machines