Relationship between Antidictionary Automata and Compacted Substring Automata

Abstract—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. I