Consider the following deterministic finite automation
Let S denote the set of eight bit strings whose second, third, sixth and
seventh bits are 1. Then which of the following strings is/are in S that are
accepted by M.
01110111
01111010
10101010
01110110
Options 1 and 4 are correct .
Given input format : * 1 1 * * 1 1 *
as 1,3,4 passing the automata but only 1, 4 satisfies input format.
64.3k questions
77.9k answers
244k comments
80.0k users