PyQdeck LogoPyQdeckSubjects
Back to the 2023 paper

Module 1: Introduction & Regular Languages

20232m

The string 11011101 does not belong to the set represented by:

(i) 1∗0∗(0+1)1^* 0^* (0+1)
(ii) 1(0+1)∗1011(0+1)^*101
(iii) (1(0)∗(0+1)∗(0+1))∗(1(0)^*(0+1)^*(0+1))^*
(iv) {00+(11)∗0}∗\{00 + (11)^*0\}^*

Search GoogleAsk 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^*20202mFORMAL LANGUAGE & AUTOMATA THEORYProve the identity: (1+00^*1) + (1+00^*1)(0+10^*1)^*(0+10^*1) = 0^*1(0+10^*1)^*20237mFormal Language & Automata TheoryConstruct DFA equivalent to the regular expression: (0+1)^* (00+11) (0+1)^*20227mFORMAL LANGUAGE & AUTOMATA THEORYConstruct NFA for the regular expression: (0+1)^*00(0+1)^*20237m
PreviousThe language \{ a^n b^n c^{n+m} \mid m, n \ge 1 \} is: (i) regular (ii) context-free but not regular (iii) context-sensitive but not context-free (iv) type 0 but not context-sensitiveNextA given grammar is called ambiguous if: (i) two or more productions have the same non-terminal on LHS (ii) a derivation tree has more than one associated sentence (iii) there exists a sentence with more than one derivation tree (iv) brackets are not present in the grammar