ISRO Scientist or Engineer Computer Science 2014 Question 79

Question 79

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



Create a FREE account and get:

  • Download Maths Shortcuts PDF
  • Get 300+ previous papers with solutions PDF
  • 500+ Online Tests for Free

Comments

Register with

OR

Boost your Prep!

Download App