### Table 1: Grammar 2. (Implemented in Dynamical Automaton 1).

"... In PAGE 19: ... The Sierpinski triangle, a kind of Cantor set, is the limit of the process of successively removing the \middle quarter quot; of a triangle to produce three new triangles. The grammar shown in Table1 is a context free grammar which includes some center-embedded structures and thus cannot be emulated by a nite state machine. A pushdown automaton for the language of Grammar 2 would need to keep track of each \abcd quot; string that has been started but not completed.... ..."

### Table 3. The BUFFER automaton.

1996

"... In PAGE 7: ... The BUFFER automaton. The BUFFER automaton appears in Table3 . The variable request stores a command while it is being buffered.... ..."

Cited by 12

### Table 7. Order Automaton

Cited by 2

### Table 5.3: Configurations for testing all scoring parameters. Configuration Pushdown Branch Critical Path Assertion- Reservation

2001

Cited by 2

### Table 1: Tableau for Evolving a Stack Objective To evolve a pushdown stack Architecture Five separate trees

1996

Cited by 1

### Table 1: The effect of the four focusing operation on the focus spaces (FS) in the pushdown focus space stack.

### Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton

in A unifying framework for seed sensitivity and its application to subset seeds (extended abstract)

2005

"... In PAGE 10: ...Table 1. Comparison of the average number of states of Aho-Corasick automaton, automaton Spi of section 3 and minimized automaton Corasick automaton not only on non-binary alphabets (which was expected), but also on the binary alphabet (cf Table1 (a)). Note that for a given seed, one can define a surjective mapping from the states of the Aho-Corasick automaton onto the states of our automaton.... ..."

Cited by 11

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