Skip to content
Related Articles

Related Articles

GATE | GATE CS 2021 | Set 2 | Question 27
  • Last Updated : 09 Apr, 2021

Consider the following deterministic finite automaton (DFA)

The number of strings of length 8 accepted by the above automaton is ___________
(A) 256
(B) 128
(C) 512
(D) 127


Answer: (A)

Explanation: In the diagram we have total 8 edges and each of the edge have 2 options either to choose 0 or 1 so we got 2^8= 256.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :