RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy

Carlos Ochoa, Gonzalo Navarro. RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy. IEEE Transactions on Information Theory, 65(5):3160-3164, 2019. [doi]

Abstract

Abstract is missing.