Computer Sciences > GATE 2021 SET-1 > Formal Languages and Automata Theory
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?
A
B
C
D
Correct : d
Similar Questions
Consider the following statements.S1: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).S2: For any context-fre...
Consider the following statements.S1: Every SLR(1) grammar is unambiguous but there are certain unambiguous grammars that are not SLR(1).S2: For any context-fre...
Consider the following statements.S1: For every infinite regular language L, there exists a subset L′ of L such that L′ is infinite and context-free.S2: For eve...
Total Unique Visitors
Loading......