Consider the following language.

L = { w ∈ {0, 1}* | w ends with the substring 011}

Which one of the following deterministic finite automata accepts L?

This question was previously asked in
GATE CS 2021 Official Paper: Shift 1
View all GATE CS Papers >

Answer (Detailed Solution Below)

Option 4 :
Free
GATE CS Full Mock Test
65 Qs. 100 Marks 180 Mins

Detailed Solution

Download Solution PDF

Option 1: Incorrect

string: 0111 is also accepted and it doesn't end with 011.

Option 2: Incorrect

string: 0110 is also accepted and it doesn't end with 011.

Option 3: InCorrect

Diagram in option needs to change

Option 4: correct

w ends with the substring 011

Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

Hot Links: teen patti master game teen patti circle teen patti gold online