Back to the 2025 paper
Similar questions
Formal Language & Automata TheoryA language is a (i) Set of alphabets (ii) Set of strings over an alphabet (iii) Set of grammars (iv) Set of automata20252mFormal Language & Automata TheoryConsider the following language: L = \{a^m b^{2n} c^{3n} d^p \mid p > m \text{ and } m, n \ge 1\} Write a context-free grammar to generate L and write shortest string in L.20197mFormal 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 above20202mFormal Language & Automata TheoryDefine the terms: Alphabet, Language, Grammar, and Derivation. Explain the relationship between them with suitable examples.20257m