### 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. Integer variables used in the probabilistic timed automata

2003

"... In PAGE 9: ... We suppose that the concrete host can send a packet to all the abstract hosts at the same time and only one of the abstract hosts can send a packet to the concrete host at a time. The set of variables of our probabilistic timed automata includes both clocks (x, y and z) and integer variables which are described in Table1 . Note that the range of the integer variable probes is changed for different verification instances, and since the abstract IP address 2 corresponds to a fresh address chosen by the concrete host we need only two buffers for the abstract hosts (corresponding to addresses of type 0 and 1).... ..."

Cited by 19

### 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 2: Parameters to the Probabilistic Counting Al- gorithm

1996

"... In PAGE 8: ... The algorithm based on probabilistic counting esti- mates the size of the cube to within a theoretically pre- dicted bound. The values of the parameters we used are shown in Table2 . The estimate is accurate under widely varying data distributions, ranging from uniform to highly skewed.... ..."

Cited by 66

### Table 2: Parameters to the Probabilistic Counting Al- gorithm

1996

"... In PAGE 8: ... The algorithm based on probabilistic counting esti- mates the size of the cube to within a theoretically pre- dicted bound. The values of the parameters we used are shown in Table2 . The estimate is accurate under widely varying data distributions, ranging from uniform to highly skewed.... ..."

Cited by 66

### Table 5 Ultrametricity: each cell records the average percentage of ultrametric `triangles apos; of local optima. Metric

1999

Cited by 31

### Table 1: Stochastic automata for L (X = p 2 E)

1997

"... In PAGE 9: ... To associate a stochastic automaton to a given term in the language, we need to de ne the di erent parts of the stochastic automaton. We start by de ning predicates and - as the least relations satisfying rules in Table1 . However, not all the processes can have a straightforward stochastic automaton as a semantic interpretation.... In PAGE 9: ...The second occurrence of xG is intended to be bound to the outermost clock setting as shown by the grey arrow. Using the rules in Table1 , the following stochastic automaton would be obtained b; fxG; yHg a; ; xG xG yH... In PAGE 13: ... We use the notion of adversaries or schedulers [29, 24] to resolve non-deterministic choices. Since parallel composition of stochastic automata can be easily de ned (actually, it is de ned just like for the process algebra, see Table1 ), the simulation algorithm can compose the complete stochastic automaton on the y, which reduces the state space explosion problem. Although (probabilistic) adversaries allow to obtain a complete probabilistic nal model, the inclusion of them as a new ingredient is not that appealing since it would require an additional e ort when modelling systems.... ..."

Cited by 13