Grand Independence day sale 🇮🇳 Get upto 75% Off on CAT courses now
Consider the following Deterministic Finite Automaton M.
Let S denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in S that are accepted by M is
0
1
2
3
Create a FREE account and get:
Ask doubts feature is currently unavailable for you. You can reach us at support@cracku.in for any further details/doubts.
Boost your Prep!