将EAH数据压缩算法转化为自动机理论
Translating the EAH Data Compression Algorithm into Automata Theory
摘要：
自适应码已在[Dragos Trinca，cs.DS/0505007]中作为一类新的非标准变长码引入。这些代码将可变长度码字与根据输入数据串中的先前符号而被编码的符号相关联。一种新的数据压缩算法，称为EAH，已经在[Dragos Trinca，cs.DS/0505061]中引入，其中我们已经从行为上表明，对于大类输入数据串，该算法实质上优于众所周知的Lempel-Ziv通用数据压缩算法。在本文中，我们把EAH编码器转化为自动机理论。
英文摘要：
Adaptive codes have been introduced in [Dragos Trinca, cs.DS/0505007] as a new class of non-standard variable-length codes. These codes associate variable-length codewords to symbols being encoded depending on the previous symbols in the input data string. A new data compression algorithm, called EAH, has been introduced in [Dragos Trinca, cs.DS/0505061], where we have behaviorally shown that for a large class of input data strings, this algorithm substantially outperforms the well-known Lempel-Ziv universal data compression algorithm. In this paper, we translate the EAH encoder into automata theory.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
