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

CAT Quant Questions | CAT Quantitative Ability

CAT Linear Equations Questions CAT Quadratic Equations Questions CAT Logarithms Questions CAT Number Systems Questions CAT Arithmetic Questions

CAT DILR Questions | LRDI Questions For CAT

CAT Coins and Weights Questions CAT Truth Lie Concept Questions CAT Games and Tournamnents Questions CAT 2D & 3D LR Questions CAT Puzzles Questions

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Grammar and Sentence Correction Questions CAT Reading Comprehension Questions CAT Odd One Out Questions CAT Para Jumbles Questions CAT Critical Reasoning Questions

Follow us on

Boost your Prep!

Download App