### TABLE I LEVELS OF CONTROL OVER ADMITTED USERS

2004

Cited by 13

### Table 2: Dynamical Automaton 1.

"... In PAGE 21: ... (Implemented in Dynamical Automaton 1). We de ne a DA (called DA 1) that recognizes the language of Grammar 2 by the Input Map shown in Table2 . The essence of the DA is a two-element vector, z, corresponding to a position on the Sierpinski triangle.... In PAGE 21: ... Given a compartment and a legal input for that compartment, the change in z that results from reading the input is shown in the \State Change quot; column. If we specify that the DA must start with z = (1/2, 1/2), make state changes according to the rules in Table2 as symbols are read from an input string, and return to z = (1/2, 1/2) (the Final Region) when the last symbol is read, then the computer functions as a recognizer for the language of Grammar 2. To see this intuitively, note that any subsequence of the form \a b c d quot; invokes the identity map on z.... ..."

### Table 1: Automaton States 4

1997

Cited by 1

### TABLE 1: Description of the Control Automaton

in Implementation Of On-Chip Programmable Digital Cellular Neural Network With Optoelectronic Interface

### Table 2. Verification of linear automaton.

### Table 5 Mean and Median SAT Scores for Engineering Admits and Non-Engineering Admits Enrolled in EG 111

### Table 10.4: Percentage Composition of Type of Admitted Flows

1997

Cited by 284