Back to the 2023 paper
Similar questions
Formal Language & Automata TheoryLet L = \{w \mid w \in \{0+1\}^*, w \text{ has even number of 1s}\}. Which one of the regular expression below represents L? (i) (0^* 10^* 1)^* (ii) 0^*(10^* 10^*)^* (iii) 0^* (10^* 1^*)^* 0^* (iv) 0^* 1(10^* 1)^* 10^*20202mFORMAL LANGUAGE & AUTOMATA THEORYConstruct NFA for the regular expression: (0+1)^*00(0+1)^*20237mFORMAL LANGUAGE & AUTOMATA THEORYDesign a DFA for the regular expression: 1^*(10)^*20217mFORMAL LANGUAGE & AUTOMATA THEORYThe string 1101 does not belong to the set represented by: (i) 1^* 0^* (0+1) (ii) 1(0+1)^*101 (iii) (1(0)^*(0+1)^*(0+1))^* (iv) \{00 + (11)^*0\}^*20232m