Let L = \{w \mid w \in \{0+1\}^*, w \text{ has even number of 1s}\}. W — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2020 paper

Module 1: Introduction, Regular languages and finite automata

20202m

Let $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^*$

Search Google Ask AI

Similar questions

FORMAL LANGUAGE & AUTOMATA THEORYDesign a DFA for the regular expression: 1^*(10)^*20217m Formal Language & Automata TheoryDesign a DFA corresponding to regular expression 1^*(10)^*.20217m FORMAL LANGUAGE & AUTOMATA THEORYConstruct NFA for the regular expression: (0+1)^*00(0+1)^*20237m Formal Language & Automata TheoryWhich of the following pairs of regular expressions are equivalent? (i) x^* and x^*x (ii) 1(01)^* and (10)^*1 (iii) x(xx)^* and (xx)^*x (iv) All of the above20222m

PreviousThe lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense? (i) Finite state automata (ii) Deterministic pushdown automata (iii) Non-deterministic pushdown automata (iv) Turing machine NextWhat is the minimum number of states in deterministic finite automata (DFA) for string starting with ba^2 and ending with a over alphabet \{a, b\}? (i) Ten (ii) Nine (iii) Eight (iv) Six