GATE Computer Science (CS) 2021 Shift 1 Solved Paper
© examsiri.com
Question : 48 of 65
Marks:
+1,
-0
Consider the following language.
L = { w ∈ {0, 1}* | w ends with the substring 011}
Which one of the following deterministic finite automata accepts L?
L = { w ∈ {0, 1}* | w ends with the substring 011}
Which one of the following deterministic finite automata accepts L?
Go to Question: