Theory of Computation
Quick practice
Question 1 of 5
If N is the NFA with 3 states and if M is minimum DFA such that L(N) = L(M). Then the machine M can have_____.
A
exactly 8 states
B
atleast 8 states
C
atmost 8 states
D
None
Get unlimited practice with GATE - CSIT, DSAI & Placements subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go