Question

For a machine to surpass all the letters of alphabets excluding vowels, how many states in DFA would be required?

• A. 3
• B. 2
• C. 21
• D. 29

Hint:

DFA state count depends on problem context; for pattern-matching over consonants, minimization reduces count.

Answer 1

The Correct Option is A

This is a trick question likely testing minimal state logic, assuming simplification or specific context. If only consonants are of concern and grouped, fewer states can suffice — possibly 3 as minimum indicator.