Skip to content
Related Articles

Related Articles

GATE | GATE CS 2021 | Set 1 | Question 48

View Discussion
Improve Article
Save Article
Like Article
  • Last Updated : 24 May, 2021

Consider the following language:

L = { w∈{0,1}∗ ∣ w ends with the substring 011 } 

Which one of the following deterministic finite automata accepts L?

(A) :

(B) :

(C) :

(D) :


(A) A
(B) B
(C) C
(D) D


Answer: (D)

Explanation: Verifying options :

(A) may end with 111. Containing 011 as substring but may not end with 011.
(B) may end with 000. Containing 011 as substring but may not end with 011.
(C) may end with 111. Containing 011 as substring but may not end with 011.
(D) Always ends with the substring 011.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!