Download detailed notes, important questions and PYQ analysis for IT503(A) Theory of Computation Unit 2.
Represents regular languages using symbols, union, concatenation and closure.
Used to find regular expressions from finite automata equations.
Used to prove that some languages are not regular.
Complete notes on regular grammars, regular expressions, regular sets, closure properties, Arden’s theorem, Myhill-Nerode theorem, pumping lemma, applications of finite automata and minimization of FSA.
Download PDFImportant RGPV questions on regular expressions, regular grammar, Arden’s theorem, pumping lemma, closure properties, Myhill-Nerode theorem and DFA minimization.
View QuestionsPrevious year questions and repeated topics from Theory of Computation Unit 2 for quick exam revision.
Open Analysis