Consider the following language: \(L= \{ w \in \{0,1\}^* \mid w \text{ ends…

GATE · 2021 · CS · Set 1 · Computer Science & IT

Consider the following language:

L={w∈{0,1}∗∣w ends with the substring 011}L= \{ w \in \{0,1\}^* \mid w \text{ ends with the substring } 011 \}

Which one of the following deterministic finite automata accepts LL ? 

Attempted by 415 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…