Back to the 2025 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYGiven the regular expression: (0+1)^*01(0+1) Describe the language generated, and construct an equivalent DFA.20257mFormal Language & Automata TheoryLet \Sigma = \{0, 1\}. Let L be the language that consists of strings having either 01 repeated one or more times or 010 repeated one or more times. Is L regular? Explain.20197mFormal 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)^*20237m