# Minimization of AFD

Difficulty
Average 50%

Contenus

## Minimization of AFD

Myhill-Nerode theorem (minimization of a AFD). Let L be a rational language. Among all L-recognizing AFDs, there is one and only one that has a minimal number of states.

Before minimizing an AFD, it must be completed, ie add a trash state like the state R on the diagram below.

The minimization algorithm is as follows:

1. Complete the AFD named D
2. Construct an initial partition ∏ containing two sets I and II of states such that ∏ = {I = (terminal acceptance states of D), II = (other states of D)}
3. For each state of D do
1. Build the transition table
2. Mark the states of departure and arrival according to their group of ∏
4. If states of the same group of ∏ have divergent behaviors
1. Separate the states into a new group (III for example) - preferably do only one separation per iteration.
5. End: the new states are the groups of ∏

## Example

Let us take the example of AFD above. It is indeed deterministic as shown by the transition table.

Let's look at the transition table in step 3:

We notice when in group I, the behavior of O and R diverge, we will therefore separate them into two groups: I = (0) and III = (R)

Here is the new transition table:

We notice when in group II, the behavior of 2 and 5, 8 diverge, we will therefore separate them into two groups: II = (5, 8) and IV = (2)

Here is the new transition table:

We no longer observe any divergence between the groups, so we can perform the transition table with minimized AFD giving the following transition table:

The initial state is I (in relation to its equivalent in D), and the terminal states of the automaton are II and IV (in relation to their equivalents in D).

## Another example

Consider the following automaton:

The initialization phase makes it possible to obtain the non-terminal group I and the terminal group II:

Let's look at the transitions for each state according to groups I and II:

Then we perform the separation of sets. Two states are in the same set if they were already in the same set and if the transitions lead in the same sets. In this example, B and D behave in exactly the same way, so they stay together. On the other hand, A and C which were part of the same set behave differently on the symbol "a". Consequently, the set noted I is divided into two. So we get:

The current situation (the Balance sheet 1 line) is different than the starting situation. So we have to start over.

The “Separation 2” line is identical to the “Separation 1” line. Consequently, in each of the remaining sets, the states are not distinguishable (they behave in exactly the same way and are therefore "redundant").

So we can build the new automaton by associating a state to each set. The transitions are indicated by the table. The initial state is the one containing the initial state of the starting automaton: here I contains state A, initial state. The final states are the states whose corresponding set contains at least one final state: here, II contains B and D which are final.

So far, we have "merged" the indistinguishable states. You must now delete all the remaining unnecessary states. In our example, state III is a sterile state (non-terminal and without transition), therefore useless. It must therefore be deleted. Hence the minimal deterministic automaton of the following figure:

FR
FR
EN
ES