Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2017 (Set 2) | Question 28

  • Last Updated : 11 Oct, 2021

The minimum possible number of states of a deterministic finite automaton that accepts a regular language
L = {w1aw2 | w1, w2 ∈{a,b}* , |w1| = 2, w2>=3} is_______
(A) 3
(B) 5
(C) 8
(D) 7


Answer: (C)

Explanation: Gate_set2_18



Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!