Computing Huffman Codes on a Turing Machine
Library Home || Full Table of Contents || Suggest a Link || Library Help
|An algorithm that computes Huffman codes on a three-tape Turing Machine. Transition table contains 243 rules. Input: Tape#0 - weights, Tape#1 - empty, Tape#2 - empty. Output: Tape#0 - weights and its Huffman codes, Tape#1 - empty, Tape#2 - empty.|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Algorithms, Formal Languages and Automata|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.