[Solution] 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 | ISRO Scientist or Engineer Computer Science 2014