An automaton A can be represented by a graph whose
nodes and arcs represent the states and the transitions of
A, respectively. An arc from q to r labeled by the event σ
represents the transition q →σ r. Several arcs labeled σ1 , · · · , σn
linking the same pair of states q, r