### Table 7.7: Transition tables of the nondeterministic and deterministic factor automata for reversed pattern P R = abbaba from Example 7.13

2006

### Table 1. Information on the size of automata.

"... In PAGE 16: ... By composition, the internal signals introduced in order to exchange messages between the processes were eliminated, and the automaton obtained by composition is an FSM representing the behaviour of the global MAP-DSM system. Detailed infor- mation on the size of the various machines, both in SDL form and as finite state machines after minimization, is represented in Table1 . We can note that with this new approach we can test the whole behaviour of the MAP-DSM system, because the final automaton obtained after the composition of the processes has 60 states and 2136 tran- sitions.... ..."

### Table 4: Class for nondeterministic finite automata

2005

"... In PAGE 2: ... But we provide methods to test for epsilon1-transitions and to convert an epsilon1-NDFA to a NDFA. See Table4 , Appendix A, for more details. 2.... ..."

Cited by 4

### Table 4: Results of the processes for calculating reversible automata.

2002

### Table 2. Finite automata pattern-matching architectures

"... In PAGE 14: ...2. Finite Automata Designs All the possible configurations of history and decoding components for finite automata (FA) designs are listed in Table2 . There is one design (GfS) that is not feasible because its his- tory and decoding styles conflict (i.... ..."

### Table 1: Messages in the finite state automata graph and their meanings

"... In PAGE 3: ... Note that the supplier then remains in its initial state until it receives the initial message from the final assembly plant. Table1 summarizes the messages and their meanings. The final assembly plant maintains a different finite state automata graph for each supplier.... ..."

### Table 2: Performance and number of minimal automata.

"... In PAGE 14: ...4GHz (dual core). In Table2 , we summarise some experimental results. Most of the values for k = 2 and k = 3, were already given by Domaratzki et al.... ..."

### Table 2: Performance and number of minimal automata.

2007

"... In PAGE 14: ...4GHz (dual core). In Table2 , we summarise some experimental results. Most of the values for k = 2 and k = 3, were already given by Domaratzki et al.... ..."

### Table 1 The sizes of the minimal automata and the minimal Fischer automata for all essential (3; 2)-CAs . (L) F (L)

1997

"... In PAGE 12: ... di erent equivalence relation; e.g., there are 84 conjugacy classes of binary CAs of width 3. Table1 lists the sizes of the minimal automata and the minimal Fischer au- tomata for all 72 essential binary CAs of width 3. As one can see from the table, there are 4 essential (3; 2)-CAs with maximum blow-up, corresponding to a total of 16 (3; 2)-CAs.... ..."

Cited by 11

### Table Deterministic Finite Automaton (DFA) (a) construction of state transition table

in Design and Evaluation of Parallel String Matching Algorithms for Network Intrusion Detection Systems