KERALA UNIVERSITY Class 4 formal languages and automata theory Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

Design a DFA to accept strings over $\{a, b\}$ containing even number of $a$ 's and odd number of $b$ 's.
State My-Hill Nerode theorem.
What is ambiguous grammar? Give an example.
Write the regular expression for set of all strings of zeroes and ones not containing 10 .
Define recursive and recursively enumerable languages. $$ (5 \times 4=20 \text { Marks }) $$ P.T.O. Answer any one full question from each Module. Each full question carries 20 marks.