### Table 1. Example FSM

in Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences

1999

"... In PAGE 3: ... The state transition table is represented by concate- nating the next states and the outputs to form a fixed length binary string. Table1 shows an example, the FSM is en- coded by concatenating the next state and the output of all rows together as 00111101 . The length of an individual is determined by the number of state.... ..."

Cited by 5

### Table 1. Example FSM

in Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences

1999

"... In PAGE 3: ... The state transition table is represented by concate- nating the next states and the outputs to form a fixed length binary string. Table1 shows an example, the FSM is en- coded by concatenating the next state and the output of all rows together as 00111101 . The length of an individual is determined by the number of state.... ..."

Cited by 5

### Table 1: Specification FSM

2006

"... In PAGE 4: ... A B-UIO may have several valid initial states that satisfy the defini- tion of this B-UIO. An example is shown in Figure 3 where the FSM ( Table1 ) is defined in section 5. Sequence dccd is a B-UIO for s0.... ..."

Cited by 2

### Table 2: Actions in the FSM.

"... In PAGE 4: ...ixel con gurations in Figure 4. The nite-state machine itself is illustrated in Figure 5. On certain transitions of the nite state machine the data structures A, L, C, X, and Y are updated. These actions are summarized in Table2 . In particular, for each data structure: The equivalence relation A.... ..."

### Table 1 Size of the transformed speci cations

"... In PAGE 13: ...sequence generation methods. Table1 illustrates the in uence of the transformation on the size of a speci cation. We applied test generation tools to the minimized FSM for the Inres initiator part.... ..."

### Table 2. Specification of an example FSM with one- hot outputs (FSM-1).

1997

"... In PAGE 3: ... FSM synthesis: (a) typical flow (b) modified flow ensures one-hot values. Let us consider the example FSM specification, FSM- 1, in Table2 that we fabricated to illustrate our FSM... ..."

Cited by 3

### Table 3 - Simple FSM decoder

"... In PAGE 7: ...able 2 - Two state FSM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Table3 - Simple FSM decoder .... ..."

### Table I: Space of solution size comparison n: number of state variables P: set of distinct state assignments for a FSM implemented with D memory elements S: set of distinct state assignments for a D implementation which satisfy our set of constraints R: set of distinct state assignments for a D implementation satisfying the set of constraints in [3]

### Table 4 - Two state FSM

1995

"... In PAGE 6: ...able 3 - Definition of the tail-information . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 Table4 - Two state FSM .... In PAGE 26: ... Internally there is a small amount of state information which is changed with each input. The entire operation can be represented by Table4 . The first column lists the current state, the next two columns are inputs.... ..."

Cited by 7

### Table 1 . Structural table of FSM

2000

Cited by 5