Back to the 2020 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYThe minimum number of transitions to reach the final state as per the regular expression: \{a, b\}^* baaa is: (i) 4 (ii) 5 (iii) 6 (iv) 320222mFormal Language & Automata TheoryDefinition of a language L with alphabet \{a\} is given as L= \{a^{nk} / k > 0, \text{ and } n \text{ is a positive integer constant}\}. What is the minimum number of states needed in a DFA to recognize L? (i) k + 1 (ii) n + 1 (iii) 2n + 1 (iv) 2k + 120222mFormal Language & Automata TheoryDefinition of a language L with alphabet \{a\} is given as L = \{a^{nk} \mid k > 0, \text{ and } n \text{ is a positive integer constant}\} What is the minimum number of states needed in a DFA to recognize L? (i) k + 1 (ii) n + 1 (iii) 2^{n + 1} (iv) 2^{k + 1}20202mFormal Language & Automata TheoryDesign deterministic finite automata for the set of strings over the alphabet \{a, b\} containing at least three occurrences of three consecutive b's, overlapping permitted (e.g., the string bbbbb should be accepted).20197m
PreviousLet 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^*NextThe decision problem is the function from string to _____. (i) char (ii) int (iii) boolean (iv) None of the above