1. Computer Science Engineering (CSE)
  2. Theory of Computation
  3. Unit 1
  4. Given a Non-deterministic Finite Automat...

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below:
P - Q
q R S
r R S
s R S
The minimum number of states required in Deterministic Finite Automation
(DFA) equivalent to NFA is

A. 5
B. 4
C. 3
D. 2
Answer» C. 3
View all MCQs in:   Theory of Computation