Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata
Let \(\rm L\) be the language over the alphabet set \(\rm \sum = \{0,1\}\) defined by the regular expression \(\rm (0 + 1)^∗ 00(0 + 1)^∗\) . Which one of the following regular expressions defines the complement of \(\rm L\)?
1
\(\rm 1^∗ 01^∗ 01^∗\)
2
\(\rm (10)^∗ 11(10)^∗\)
3
\(\rm (0 + 10)^∗(1+\in)\)
4
\(\rm (1 + 01)^∗ (0 + \in)\)
5
Question Not Attempted