Combinatorial property of prefix-free trees with some regular constraints
by Yeung Siu Yin
THESIS
2004
M.Phil. Computer Science
ix, 68 leaves : ill. ; 30 cm
Abstract
In this thesis we discuss how to construct binary prefix-free codes for n equiprobable symbols when the codewords are constrained to all be in a given regular language L.
Previous work on this problem had restricted itself to regular languages L that could be accepted by Deterministic Finite Automatons (DFA) with only one accepting state. In this thesis we
⋅ discuss some general structural principles that hold when L is any DFA and
⋅ Provide a full analysis when L is accepted by a DFA that has two accepting states.
Post a Comment