Theory of Computation
Q211.
Let L=\left\{w \in(0+1)^{*} \mid w \text { has even number of } 1 \text { 's }\right\}, i.e. L is the set of all bit strings with even number of 1's. Which one of the regular expression below represents L?Q213.
Let S and T be languages over \Sigma=\{a.b\} represented by the regular expressions (a+b^*)^* \text{ and } (a+b)^*, respectively. Which of the following is true?Q215.
If the regular set A is represented by A = (01 + 1)^* and the regular set B is represented by B = \left(\left(01\right)^*1^*\right)^*, which of the following is true?Q216.
Which two of the following four regular expressions are equivalent? (\varepsilon is the empty string). (i). (00)^ * (\varepsilon +0) (ii). (00)^* (iii). 0^* (iv). 0(00)^*Q217.
Which one of the following regular expressions over {0,1} denotes the set of all strings not containing 100 as substring?Q218.
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following regular expression identities is/are TRUE?Q219.
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If L and D denote the sets of letters and digits respectively, which of the following expressions defines an identifier?Q220.
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only.Let r=1(1+0)^*, s=11^*0 \text{ and } t=1^*0 be three regular expressions. Which one of the following is true?