Relationship between antidictionary automata and compacted substring automata

Takahiro Ota, Hiroyoshi Morita · 2013

There are two efficient static data compression algorithms called an antidictionary coding and a lossless data compression via substring enumeration coding. We prove that both of the encoders are isomorphic.

Read the paper · More papers on PaperTik