Several different Transformations-formal language and automatic machine theory

1. Minimize DFA.

DFA is minimized. The simplest understanding is "split the branches and leaves the trunk". The minimized DFA is equivalent to the original state and has fewer States.

Split the branches, cut the leaves, and keep the dry leaves. During simplification, the equivalent State is merged.

So how to find the equivalent State? All terminologies are equivalent. This is also the basis for finding equivalent symbols. For details, see the following example.

Simplification steps: 1. Draw the State Matrix figure 2 and find the terminator (equivalent ). 3. Based on the found equivalent Terminator, continue to find other equivalent symbols. Solution: q0 and Q1 are equivalent because q0 and Q1 1 reach Q2, (q0, Q1) = (Q1, q0. 4. Conversion. Figure 5 shows the minimum DFA. 2: NFA-> DFA transition. The given NFA is graph conversion step: 1, write I, I0, i1, 2, write I = {q0} start symbol 3, evaluate I0, i1 4, all the elements that contain the final State are the final state. NFA matrix conversion diagram:

Conclusion: The first one of I is the start symbol q0, and the third one is that the previous one is different from the previous one. Until I includes all I0 and I1, it stops. 3. the NFA-to-NFA NFA3-1 shows the steps for converting to equivalent NFA: 1, similar to the NFA-to-DFA first step, the difference is that, the first character on the left is the start symbol q0 and all characters After q0 and null. For example, the first character in Figure 3-1 is {q0, Q1, Q2} 2. The second step is to find the second character and all the characters that can be recognized for moving null. 3, and so on until all characters appear. As shown in Figure 3-2, the equivalent NFA is shown in Figure 3-3.

Conclusion: The NFA-to-NFA and NFA-to-DFA do not need to be left-side symbols. The NFA-to-DFA-to-left symbols cannot be easily viewed. You must follow the instructions on the right side, the first one is a starting symbol. The left side of the empty NFA to the NFA is all the symbols and the symbols that can be reached by recognizing null, the first symbol is the start symbol or the start symbol and the symbol used to identify the arrival of null.