"... In PAGE 10: ...1), s is the state in which the conformance check starts, and A is the smallest interface automaton that con- forms to the process P. The typing rules for processes are given in Table6 and for actions in Table 7. The rules match the intuition behind the abstractions we have introduced informally in Section 3.... ..."

"... In PAGE 7: ... The BUFFER automaton. The BUFFER automaton appears in Table3 . The variable request stores a command while it is being buffered.... ..."

"... In PAGE 10: ...Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton Corasick automaton not only on non-binary alphabets (which was expected), but also on the binary alphabet (cf Table1 (a)). Note that for a given seed, one can define a surjective mapping from the states of the Aho-Corasick automaton onto the states of our automaton.... ..."

"... In PAGE 21: ... (Implemented in Dynamical Automaton 1). We de ne a DA (called DA 1) that recognizes the language of Grammar 2 by the Input Map shown in Table2 . The essence of the DA is a two-element vector, z, corresponding to a position on the Sierpinski triangle.... In PAGE 21: ... Given a compartment and a legal input for that compartment, the change in z that results from reading the input is shown in the \State Change quot; column. If we specify that the DA must start with z = (1/2, 1/2), make state changes according to the rules in Table2 as symbols are read from an input string, and return to z = (1/2, 1/2) (the Final Region) when the last symbol is read, then the computer functions as a recognizer for the language of Grammar 2. To see this intuitively, note that any subsequence of the form \a b c d quot; invokes the identity map on z.... ..."