Regular Language and Finite Automata|| (1 Mark)||MCQ||2017

Last Updated :
Discuss
Comments

The minimum possible number of a deterministic finite automation that accepts the regular language
L = {w1aw2 | w1, w2 ∈ {a,b}*, |w1| = 2,|w2| ≥ 3} is _________

[GATE 2017||SET-2 MCQ|| 1-mark]


8

9

10

11

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
Theory of Computation
DFA
GATE CS
Share your thoughts in the comments
Article Tags :