RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy (Q5223991)
From MaRDI portal
scientific article; zbMATH DE number 7082741
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy |
scientific article; zbMATH DE number 7082741 |
Statements
RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy (English)
0 references
19 July 2019
0 references
