// Modeling accepting automata as LTS - Minimization
// We use a transition labelled accept to indicate the accepting states of the automaton,
// otherwise, the accepting automaton is simply an LTS
// The following automaton is the one obtained for the regular expression (a | b)* a b b
// after determinization; it is not minimal (see course notes).
// The equivalent minimal automaton is contructed by the LTSA when one selects the Build -> Minimize command.
// This works for deterministic automata only.
A = (a -> B | b -> C),
B = (a -> B | b -> D),
C = (a -> B | b -> C),
D = (a -> B | b -> E),
E = (a -> B | b -> C | accept -> END).