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

Practice authentic previous year questions for better exam preparation.

Sample Questions

List and explain the properties of transition functions.
State pumping lemma for regular set.
Explain the use of decision algorithm for regular sets.
Let r be a regular expression. Prove that there exists an NFA with $\varepsilon$-transitions that accepts $L(r)$.
Compare and contrast between Chomsky normal form and Greibach normal forms.