Back to the 2020 paper
Similar questions
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 above20222mFORMAL LANGUAGE & AUTOMATA THEORYWhich of the following is a regular language? (i) Strings whose length is a sequence of prime numbers (ii) Palindrome strings (iii) Strings containing substring ww^r (iv) Strings with even number of 0’s20242mFORMAL LANGUAGE & AUTOMATA THEORYWhich of these represents a regular language? (i) \{ a^n b^n \mid n \ge 0 \} (ii) Strings with equal number of a’s and b’s (iii) \{ a^n \mid n \text{ is prime} \} (iv) \{ w \mid w \text{ starts with 'a' and ends with 'b'} \}20242mFormal Language & Automata TheoryLet w be any string of length n in \{0, 1\}^*. Let L be the set of all substrings of w. What is the minimum number of states in a non-deterministic FA that accepts L? (i) n - 1 (ii) n (iii) n + 1 (iv) 2n - 120192m
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 machineNextWhat 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
Free AppAndroid App
Coursify Android App
Generate AI courses, take quick quizzes between classes, and master complex engineering concepts on the go.