GATE | GATE-CS-2003 | Question 90
Consider the following deterministic finite state automaton M.
Let S denote the set of seven bit binary strings in which the first, the fourth, and the last bits are 1. The number of strings in S that are accepted by M is
Explanation: Given a language of 7 bit strings where 1st, 4th and 7th bits are 1.
The following are 7 strings of language that can be accepted by DFA.
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.