Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata
Let L be the language over the alphabet Σ= {0,1} accepted by the DFA shown below. Which one of the following languages is the complement of L?
1
The set of all strings containing at least one 0 and at least one 1.
2
The set of all strings containing the substring 01.
3
The set of all strings starting with 1 and ending with 0.
4
The set of all strings not containing the substring 01.
5
Question Not Attempted