Convert NFA to DFA and explain the difference between them

Some basic difference between a Non-deterministic finite automata (NFA) and Deterministic Finite Automata (DFA) is that in DFA each state has an output for each of the inputs, whereas this is not necessary for NFA.

Also, in NFA the input can be \epsilon but in DFA this is not the case.

Moreover, in NFA one state can go to a different state on the same output but this is not the case with DFA.

Usually, we convert an NFA into a DFA by making the state transition diagram for the given NFA and accordingly vary that state diagram for the DFA. From this state transition diagram, we can make the DFA.

Problem

Convert the given NFA to DFA.

Solution

The given NFA is as follows −

The transition table for NFA is as follows

The transition table for DFA is as follows

The DFA transition diagram is as follows −

Bhanu Priya

Updated on 11-Jun-2021 13:10:17

• Related Questions & Answers
• What is the difference between DFA and NFA?
• Explain with an example how to convert NFA to DFA.
• What is the difference between DFA and NFA in compiler design?
• How to convert from NFA to DFA in TOC?
• How to convert NFA with epsilon to DFA in TOC?
• Construct NFA for the following language and convert it into DFA using the algorithm - L = (aa+ (bb*)c*)
• Give an example problem of converting NFA to DFA.
• Explain the Difference Between Definition and Declaration
• Explain the difference between Virus and Worm?
• Explain the difference between OLAP and OLTP
• Explain Arden’s theorem to convert DFA to Regular Expression
• Explain the concatenation process in DFA
• Explain the complementation process in DFA
• State the worst case number of states in DFA and NFA for a language?
• Explain the difference between physical and logical databases