Ekuivalensi Non-Deterministik Finite Automata (NFA) 1 ke Deterministik Finite Automata (DFA) 2

Perhatikan dan ingat kembali NFA pada Design Non-Deterministic Finite Automata 2

 

Design the NFA

                                                     Transition Table

 

 

Dari diagram dan tabel NFA, maka kita bisa mendapatkan DFA yang ekuivalen dengan menambahkan lagi 1 state dengan input Ø ,  

Equivalance NFA to DFA 1

Please remember...on Design Non-Deterministic Finite Automata 1

 

Equivalance

 

Design Non-Deterministic Finite Automata 2

The next...
We can also make a design NFAs with 2 states and the rules are: strings that can be received must start with '0'.
Examples of acceptable strings:

• '0', 
• '00', 
• '01',
• '0 *', 
• '01 * ', 
• '01 * 0 *',
• '0 * 1 *', ...

The Answer:

 

Design the NFA

                                                     Transition Table