An*automaton*, defined precisely in Chapters 5 and 6, is a finite-state transition system used to define a set of strings or sequences of discreteevent behaviors. Classically, the transition structure of an automaton is represented “dynamically” in terms of a transition function which gives the “next” states as a function of each “current” state and input, as in Figure 2.1. When the “alphabet” of “inputs events” is represented by the values of a vector × (as typically is the case in practice), this representation can be very cumbersome. For example, if