One or more states are start states, unless the automaton is empty.
Our construction can be modified by adding final states to recover the classical minimal realisation theory for finite automata.
One natural implementation of this language of automata is to create a vector or other random-access data structure to represent the states.
Extended patterns such as (2) are stripped of actions and compiled into automata whose union yields level recognizers, just as before.
We give the language an operational semantics in terms of a simplified version of probabilistic automata.
The operational semantics is given in terms of probabilistic automata.
In the operational approach, the semantics of a program is specified using the transition function of a suitable abstract machine (automaton).
The dictionary can then be represented by an automaton in which final states are provided with numbers referring to these codes.
