Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below: The minimum number of states required in Deterministic Finite Automation(DFA) equivalent to NFA is
A)5
B)4
C)3
D)2

Question

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below:  The minimum number of states required in Deterministic Finite Automation(DFA) equivalent to NFA is
A)5 
B)4 
C)3 
D)2

Quizplus · Accepted Answer

The Answer of Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below:  The minimum number of states required in Deterministic Finite Automation(DFA) equivalent to NFA is
A)5 
B)4 
C)3 
D)2

Given a Non-Deterministic Finite Automation (NFA) with States P and R