function DFST = define_dfst

% 1. a DFST is defined by
% 2. an input alphabet ALF_in
% 3. an output alphabet ALF_out
% 4. a set of states Q 
%    (Q is an integer; we assume the state set = {1,2,3,...,Q}
%     and the start state is always 1)
% 5. a set of accepting states F \subste {1,2,3,...,Q}
% 6. a function delta : (q,s) \mapsto (q',s')
%    where q\in Q, s\in ALF_in; q'\in Q, s\in ALF_out; 

DFST.ALF_in = char('A':'Z');
DFST.ALF_out = char('A':'Z');

return