MPhil Thesis Defence


"Combinatorial Properties of Prefix-free trees with some Regular
Constraints"

By

Mr. Siu Yin Yeung


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

(1) discuss some general structural principles that hold when  L is ANY
DFA and

(2) Provide a full analysis when L is accepted by a DFA that has TWO
accepting states.


Date:				Tuesday, 27 January 2004

Time:				2:00p.m.-4:00p.m.

Venue:				Room 2406
				Lifts 17-18

Committee Members:		Prof. Mordecai Golin (Supervisor)
				Prof. Rudolf Fleischer (Chairman)
				Prof. Cunsheng Ding


**** ALL are Welcome ****