### Table 1. Primitive delay-insensitive modules with their initial configurations embedded in cellular automata. The Parallel MERGE module in [15] is here called MERGE for simplicity.

### Table of partial permutivities of some elementary cellular automata.

### Table 6: Optimization for Cellular Automata Model

2005

"... In PAGE 30: ...As indicated in Table6 , there is fairly good agreement between the recommended number of booths for a typical day and for peak hours. However, we note that the optimal booth number for a typical day never exceeds that for rush hour.... In PAGE 30: ... Rush hour seems to require slightly more booths than a typical day in order for the plaza to operate most efficiently. Each value in Table6 is representative of approximately 20 trials. Through these trials, we noted a remarkable stability in our model.... ..."

### Table 1: Dynamics of Circular Elementary Cellular Automata

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

### 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 1: Data and estimated costs of link components (simple configuration)

1997

"... In PAGE 1: ...epeater amplifiers. Fig. 1 shows the costs for three different coaxial and one singlemode FO bidirectional links (up- and downlink). The component data and costs are given in Table1 . All components are low cost as necessary for (micro) cellular repeater systems, except the low loss cables.... ..."

Cited by 2

### Table 1 Water properties related to cellular automata attributes Property Equation r2 correlation

"... In PAGE 4: ... We have tested this possibility, considering several properties of water. In Table1 a set of equations re- lating several physical properties of water to attributes from the cellular automata simulations are shown. In addition the free hydrogen fraction, fH, is close to the value of about 15% reported from infrared evi- dence of the free OH content [15].... ..."

### Table 2: Elementary cellular automata rules as classi#0Ced to #0Cve classes.

1990

Cited by 14