### 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 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 Automata

2002

### Table 2. Extended file structure associated with a finite element host

2000

"... In PAGE 40: ... Accordingly, some methods to label fibers entering or leaving the finite element become necessary. Before labeling fibers entering or leaving the finite element, we extend our file structure associated with a finite element host to include apos;ambiguous apos; segment subdirectories ( Table2 ). Ambiguous segments are neuronal fibers that are not yet distinguished as either dendritic or axonal.... In PAGE 41: ... 31 Table2 . Continued Type directory/file Name Contents Purpose (If an exiting segment,) - exiting segment label - entering segment label if known (If an entering segment,) - entering segment label Daughter dendritic segment subdirectories (level n+1) Axonal segment subdirectory (level m) Axonal segment label Axonal segment geofile Axonal segment synapse file (If an exiting segment,) - exiting segment label - corresponding entering segment label if known (If an entering segment,) - entering segment label Daughter axonal segment subdirectories (level m +1) Ambiguous segment subdirectory (level n) Ambiguous segment label Ambiguous segment address Segment geofile Segment synapse file (if an exiting segment) - exiting segment label - corresponding entering segment label (if an entering segment) - entering segment label Ambiguous segment subdirectories (level n+1) Coordinates within the FE Position and orientation of segment within the FE ... ..."

### Table 2. Checks and verification Here, the problem of space and time complexity of the finite state machines (automata) for recognizing languages arises. In general, the classical regular language operators (concatenation, alternative, repetition) do not introduce any exponential growth of the state space of a parsing finite state automaton. However, behavior protocols employ also the and- parallel, composition, and adjustment operators that introduce exponential complexity of the resulting automata which might lead to the state explosion problem. In fact, the composition and adjustment operators behave better than the and-parallel operator in terms of the required state space as they comprise synchronization of events, thus reducing the interleaving of traces.

2002

Cited by 112

### TABLE I Comparison of some self-replicating structures in cellular space models. Models shown include variations of cellular automata: CT-machines are programmable finite automata with registers, -Universes are CAs augmented with chemistry-like operators, non-uniform CAs allow cells to have differing rules, and W-machines are Turing machine models that are programmable using high-level instructions.

1997

Cited by 18

### TABLE I Comparison of some self-replicating structures in cellular space models. Models shown include variations of cellular automata: CT-machines are programmable finite automata with registers, -Universes are CAs augmented with chemistry-like operators, non-uniform CAs allow cells to have differing rules, and W-machines are Turing machine models that are programmable using high-level instructions.

1997

Cited by 18

### lable sequence ~.6 The automata

1997

Cited by 54