Regular Language and Finite Automata|| (2 Mark)||NAT||2020

Last Updated :
Discuss
Comments

Consider the following language. L = {X ϵ {a,b}* | number of a’s in x is divisible by 2 but not divisible by 3}. The minimum number of states in a DFA that accepts L is _______.

[GATE 2020|| NAT || 2-mark]


6

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
GATE CS
Share your thoughts in the comments
Article Tags :