/*************************************************

Laughing machine c1 
(for use in the exercise of Lecture 3)

Deterministic, complete and epsilon-free 
version of the 'laughing machine'.


20/05/03 stwa
*******************************************/

start(c1,1).

final(c1,4).

trans(c1,1,2,h).
trans(c1,2,3,a).
trans(c1,3,4,!).
trans(c1,3,2,h).

%% Completion: Edges to an added 'dead' state 5.

trans(c1,1,5,a).
trans(c1,1,5,!).
trans(c1,2,5,h).
trans(c1,2,5,!).
trans(c1,3,5,a).
trans(c1,4,5,h).
trans(c1,4,5,a).
trans(c1,4,5,!).

