### 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 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. 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 2. Implementability of asynchronous automata with multiple initial states

2004

"... In PAGE 2: ...ity 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 , col- umn 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: ...ity 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, col- umn 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). The paper is organized as follows.... ..."

### Table 2. Implementability of asynchronous automata with multiple initial states

2004

"... In PAGE 2: ...ity 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 , col- umn 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: ...ity 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, col- umn 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). The paper is organized as follows.... ..."

### Table 1. Decidability of the model property for timed automata with behavioural re- strictions wrt. speci cations from di erent fragments of Duration Calculus. The frag- ments are named after the shapes of allowed atomic formulae.

"... In PAGE 9: ... To the best of our knowledge, these are the rst e ective procedures available for a dense-time Duration Calculus with metric time, the chop modality, and unrestricted negation. Table1 provides an overview over the decidability results for model-checking timed automata against various fragments of dense-time Duration Calculus. A particular implication of these ndings is that even extremely abstract real-time formalisms can be integrated into the design process of embedded controllers through key-press techniques.... ..."

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