### Table 2. Algorithm Framework for GA-DFALS Algorithm: Learning Deterministic Finite-state Automaton Based on Genetic Algorithm (A Basis)

2006

"... In PAGE 8: ...dure [7], and it is so called standard genetic algorithm 4. The core of our learning system (Deterministic Finite-state Automaton Learning System Based on Genetic Algorithm, GA-DFALS) is based on this framework (see Table2 ). The genetic operators we used are fitness proportionate selection operator, uniform crossover operator, and point mutation operator.... ..."

### Table 1 Subset of the Finite State Processes (FSP) notation

"... In PAGE 10: ... Finite State Processes (FSP) [12] is an algebraic notation for describing La- beled Transitions Systems. The main elements of the notation are summarized in Table1 . A Labeled Transitions System (LTS) is a form of state machine for the modeling of concurrent systems in which transitions are labeled with action names.... ..."

### TABLE 5 Finite-State Symbol Generating Grammars

2002

Cited by 4

### TABLE VIII THE NUMBER OF STATES FOR FINITE-STATE CODES BY ALGORITHM A

### TABLE I. A Finite-State Automaton for Recognizing Tokens Old

### Table 1. As we can see from this table, finite state method is better in the relative processing speed and for processing existing patterns while statistical model is better for processing new sentence patterns, which makes the system very robust.

"... In PAGE 5: ...Fixed Fast 100% Partial Result Single FSM Fixed Fast 100% Die Stat Model Open Slow 85%(pre) 95%(rec) 75%(pre) 92%(rec) Table1 . Results Comparison On the other hand, we investigate the performance of statistical model in more detail on the blind test.... ..."

### TABLE I FINITE STATE MACHINE STATISTICS.

1998

Cited by 14