### 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 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 Deterministic Finite Automaton (DFA) (a) construction of state transition table

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

### 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 7.7: Transition tables of the nondeterministic and deterministic factor automata for reversed pattern P R = abbaba from Example 7.13

2006

### Table 2. Implementability of asynchronous automata with multiple initial states

2004

"... In PAGE 2: ...ity problem has the same complexity as for synchronous products in the nondeterministic case, but can be solved in polynomial time in the deterministic case ( Table2 , col- umn 3). Maybe surprisingly, a simple trick allows us to extend this result to the implementability problem modulo bisimulation, again when the implementation is required to be deterministic (Table 2, column 4).... In PAGE 2: ...ity problem has the same complexity as for synchronous products in the nondeterministic case, but can be solved in polynomial time in the deterministic case (Table 2, col- umn 3). Maybe surprisingly, a simple trick allows us to extend this result to the implementability problem modulo bisimulation, again when the implementation is required to be deterministic ( Table2 , column 4). The paper is organized as follows.... ..."

### Table 2. Implementability of asynchronous automata with multiple initial states

2004

"... In PAGE 2: ...ity problem has the same complexity as for synchronous products in the nondeterministic case, but can be solved in polynomial time in the deterministic case ( Table2 , col- umn 3). Maybe surprisingly, a simple trick allows us to extend this result to the implementability problem modulo bisimulation, again when the implementation is required to be deterministic (Table 2, column 4).... In PAGE 2: ...ity problem has the same complexity as for synchronous products in the nondeterministic case, but can be solved in polynomial time in the deterministic case (Table 2, col- umn 3). Maybe surprisingly, a simple trick allows us to extend this result to the implementability problem modulo bisimulation, again when the implementation is required to be deterministic ( Table2 , column 4). The paper is organized as follows.... ..."

### Table 2. Implementability of asynchronous automata with multiple initial states

"... In PAGE 2: ...) In [Zie89], Zielonka characterized the transition systems that can be imple- mented as an asynchronous automata modulo language equivalence. Combin- ing this result with several others from the literature, we show that the imple- mentability problem has the same complexity as for synchronous products in the nondeterministic case, but can be solved in polynomial time in the deterministic case ( Table2 , column 3). Maybe surprisingly, a simple trick allows us to extend this result to the implementability problem modulo bisimulation, again when the implementation is required to be deterministic (Table 2, column 4).... In PAGE 2: ... Combin- ing this result with several others from the literature, we show that the imple- mentability problem has the same complexity as for synchronous products in the nondeterministic case, but can be solved in polynomial time in the deterministic case (Table 2, column 3). Maybe surprisingly, a simple trick allows us to extend this result to the implementability problem modulo bisimulation, again when the implementation is required to be deterministic ( Table2 , column 4). Partly motivated by the complexity results, in the last part of the paper we present new prototype implementations for asynchronous automata synthesis... ..."

### Table 2. Algorithm Framework for GA-DFALS Algorithm: Learning Deterministic Finite-state Automaton Based on Genetic Algorithm (A Basis)

2006

"... In PAGE 8: ...dure [7], and it is so called standard genetic algorithm 4. The core of our learning system (Deterministic Finite-state Automaton Learning System Based on Genetic Algorithm, GA-DFALS) is based on this framework (see Table2 ). The genetic operators we used are fitness proportionate selection operator, uniform crossover operator, and point mutation operator.... ..."