Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Universal Tree Source Coding Using Grammar-Based Compression   We apply so-called tree straight-line programs to the problem of lossless
compression of binary trees. We derive upper bound on the maximal pointwise
redundancy (or worst-case redundancy) that improve previous bounds obtained by
Zhang, Yang, and Kieffer using directed acyclic graphs. Using this, we obtain
universal codes for new classes of structered tree sources.

29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
19
The categories of this paper are: eess
9
The categories of this paper are: nlin
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex