KERALA UNIVERSITY Class 6 formal languages and automata theory Question Paper 2021

Practice authentic previous year questions for better exam preparation.

Sample Questions

Explain the use of universal Turing machine.
(a) (i) Construct a Turing Machine to recognize the language $L=\left\{0^{n} 1^{n} 0^{n} \mid n>=1\right\}$. (ii) Explain the universal Turing machine with an example.
(i) Construct a Turing Machine to recognize the languag $L=\left\{0^{n} 1^{n} 0^{n} \mid n>=1\right\}$. xplain the universal Turing machine with an example. (ii) Prove that the union of two-recursive language is recursive and union of two recursively...
Construct context free grammar for the following CFLs (a) $L=\left\{a^{n} b^{m} \mid n, m>=1\right\}$
Construct context free grammar for the following CFLs (b) $L=\left\{a^{n} b^{m} c^{m} d^{n} \mid n, m>=1\right\}$.