Back to the 2020 paper
Similar questions
FORMAL LANGUAGE & AUTOMATA THEORYWrite short notes on: 1. Minimization of DFA 2. Type 2 grammar (Context-Free Grammar)20247mArtificial intelligenceWrite a short note on: Natural Language Processing20257m Compiler DesignChoose the correct option / answer the following: Which grammar type is recognized by a push-down automaton? (i) Regular (ii) Context-free (iii) Context-sensitive (iv) Unrestricted20242mFormal 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