Question

Consider the following deterministic finite automata (DFA).

The number of strings of length 8 accepted by the above automation is

• A. 256

Answer 1

The correct option is A 256

The regular expression for L(M) is $0(0+1)(0+1)(0+1{)}^{\ast }+1(0+1\left)\right(0+1\left)\right(0+1{)}^{\ast }$

= $(0+1)(0+1)(0+1)(0+1{)}^{\ast }$

So. all strings of length $\ge 3$ accepted.

Therefore number of strings of length 8 is $2^s=256$.