1.

Consider the following Deterministic Finite Automaton.Let denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. The number of strings in that are accepted by M is(A) 0(B) 1(C) 2(D) 3

Answer»


Discussion

No Comment Found

Related InterviewSolutions