SP19 Automta Theory Course Material usman January 18, 2019 SP19 Automata Theory 0 Comments Lec-01 Intro Lec-02 Languages Lec-03 Languages 2 Lec-04 Regular Expressions , Sample Questions Lec-05 Regular Expressions Cont Lec-06 Finite Automata Lec-07 Finite Automata Cont Lec-08 Finite Automata Cont.. Lec-09-10 Transition Graphs and NFAs Lec-11 Kleene’s Theorem Lec-12 Kleene’s Theorem 2 Lec-13 Kleene’s Theorem 3 Lec-14 Kleene’s Theorem 4 Lec-15 Nondeterministic Finite Automaton (NFA) Lec-17-18 Finite Automata with Output Lec-19 Finite Automata with Output 2 Lec-21 Regular Languages Lec-23 Nonregular Languages Lec-24 Decidability Lec-26 Context Free Grammars Lec-27 Context Free Grammars Lec-28 Grammatical Format mealey2moore Post navigation Previous Previous post: FA18 BSE Web Technologies Information PageNext Next post: Miscellaneous Automata Theory Material Leave a Reply Cancel reply Your email address will not be published. Required fields are marked *Comment Name * Email * Website