Which of the following pairs of regular expressions are equivalent? (i — PYQDeck

PyQdeckBEU PYQ Archive Subjects

Back to the 2022 paper

Module 1: Introduction, Regular languages and finite automata

20222m

Which 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 above

Search Google Ask AI

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^*20202m Formal Language & Automata TheoryDesign a DFA corresponding to regular expression 1^*(10)^*.20217m FORMAL LANGUAGE & AUTOMATA THEORYIf P and Q are regular expressions (P is not null), then R = Q + RP has the unique solution: (i) R = QP (ii) R = PQ^* (iii) R = QP^* (iv) R = QP^*20232m FORMAL LANGUAGE & AUTOMATA THEORYDesign a DFA for the regular expression: 1^*(10)^*20217m

Previous___________ is the acyclic graphical representation of a grammar (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above NextThe maximum number of states of a DFA converted from an NFA with n states is (i) n (ii) n^2 (iii) 2^n (iv) None of these