𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Prefix codes, trees, and automata

✍ Scribed by Jean-Louis Lassez

Publisher
Elsevier Science
Year
1975
Tongue
English
Weight
790 KB
Volume
8
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal binary prefix-condition codes wi
Optimal binary prefix-condition codes with ordinal probabilities
✍ Greenberg, Irwin πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 432 KB

Probability estimates for letters in a finite alphabet are derived in order to apply the Huffman algorithm to determine an optimal binary prefix-condition code. The estimates maximize the entropy subject to constraints specifying second-level orderings of the letters' iikeiihoods. These are compared

Rabin tree automata and finite monoids
Rabin tree automata and finite monoids
✍ DaniΓ¨le Beauquier; Andreas Podelski πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 858 KB
On ground tree transformations and congr
On ground tree transformations and congruences induced by tree automata
✍ SΓ‘ndor VΓ‘gvΓΆlgyi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 230 KB

For a tree automaton A over a ranked alphabet , we study the ground tree transformation (A) induced by A and the restriction Γ‚(A) of the congruence ↔ \* A to terms over . We deΓΏne a congruence relation βŠ† A Γ— A on A, called the determiner of A, and the quotient tree automaton A= . We show the followi