🏁 Starts from Monday (6th Feb) 👉 Enroll to CAT 2023 nine months batch here
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
Create a FREE account and get:
Ask doubts feature is currently unavailable for you. You can reach us at firstname.lastname@example.org for any further details/doubts.
Boost your Prep!