Title :
Relationship between antidictionary automata and compacted substring automata
Author :
Ota, Takahisa ; Morita, Hiroyuki
Author_Institution :
Dept. of Comput. & Syst. Eng., Nagano Prefectural Inst. of Technol., Ueda, Japan
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.
Keywords :
automata theory; data compression; encoding; antidictionary automata; antidictionary coding; compacted substring automata; isomorphic encoders; lossless data compression; static data compression algorithm; substring enumeration coding; Automata; Computers; Data compression; Dictionaries; Educational institutions; Electronic mail; Encoding;
Conference_Titel :
Information Theory and Applications Workshop (ITA), 2013
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-4648-1
DOI :
10.1109/ITA.2013.6502965
