Back to the 2021 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORY____ is the acyclic graphical representation of a grammar. (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20212mFormal Language & Automata Theory___________ is the acyclic graphical representation of a grammar (i) Binary tree (ii) Octtree (iii) Parse tree (iv) None of the above20222m Compiler DesignChoose the correct answer of the following: A grammar that produces more than one parse tree for some sentence is said to be (i) Ambiguous (ii) context free (iii) disambiguous (iv) regular20222mFormal Language & Automata TheoryA _____ is context free grammar with atmost one non-terminal in the right handside of the production. (i) linear grammar (ii) linear bounded grammar (iii) regular grammar (iv) None of the above20202m
PreviousLet N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the following is necessarily true? (i) m \le 2^n (ii) n \le m (iii) M has one accept state (iv) m = 2^nNextA minimum state deterministic FA accepting the language L = \{w \mid w \in \{0, 1\}^*\} where number of 0's and 1's in w are divisible by 3 and 5 respectively, has (i) 15 states (ii) 11 states (iii) 10 states (iv) 9 states