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
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 Correct Answer 2
The correct answer is Option 3.
Key Points
[ alt="F4 Raju S 14-4-2021 Swati D8" src="//storage.googleapis.com/tb-img/production/21/04/F4_Raju%20S_14-4-2021_Swati_D8.png" style="width: 380px; height: 92px;">
01100110, 01100111, 01101110, 01101111, 01110110, 01110111, 01111110, 01111111, 11100110, 11100111, 11101110, 11101111, 11110110, 11110111, 11111110
11111111 among the above 16 strings only two strings are accepted.
According to the DFA transition diagram, the possible strings accepted by M is 01110110, 01110111
The above two strings are having constraints that the 2nd,3rd, 6th and 7th bits are 1.
So, it satisfied the above condition.
Hence the correct answer is 2.
মোঃ আরিফুল ইসলাম
Feb 20, 2025