NDFST interpreter
(Nondeterministic Finite State Transducer)
Dafydd Gibbon, 2008-08-12
Input:
Switches:
Trace:
off
on
Direction:
forward
reverse
Relation:
off
on
FSA:
# Generator technique: all items on the input tape are the same ('X' or any # other symbol). Each such symbol matches at least one item on the other tape, # so all well-formed outputs of the same length as the input are generated. # Initial state: initial = q0 # Set of terminal states: terminal = q6 # Transition quadruples <currentstate,inputsymbol,outputsymbol,nextstate>: # This is the set of fst transitions: fst = q0,X,the,q1; q1,X,very,q2; q1,X,very,q1; q1,X,quite,q2; q1,X,quite,q1; q1,X,unbelievably,q2; q2,X,elegant,q3; q2,X,tiny,q3; q3,X,girl,q4; q3,X,lady,q4; q4,X,visited,q5; q4,X,loves,q5; q5,X,London,q6; q5,X,Paris,q6
Go:
Other examples...