Theory of Automata, Formal Languages and Computation
Theory of Automata, Formal Languages and Computation. Instructor: Prof. Kamala Krithivasan, Department of Computer Science and Engineering, IIT Madras. This course provides an introduction to the basic models of computability, covering topics: grammars, context free grammars, finite state automata and regular expressions, pushdown automata, Turing machines, decidability, complexity theory, DNA computing, membrane computing.
(from nptel.ac.in
Lecture 11 - Nondeterministic Finite State Automata with Epsilon-Moves
VIDEO
Go to the Course Home
Grammars: Properties of Context Free Grammars
Lecture 01 - Grammars and Natural Language Processing
Lecture 02 - Grammars and Languages Generated
Lecture 03 - Grammars and Languages Generated (cont.)
Lecture 04 - Ambiguity in CFG (Context Free Grammar)
Lecture 05 - Simplification of CFG
Lecture 06 - Removal of Unit Productions, Chomsky Normal Form for CFG
Lecture 07 - Greibach Normal Form for CFG
Finite State Automata and Regular Expressions
Lecture 08 - Finite State Automata
Lecture 09 - Nondeterministic Finite State Automata
Lecture 10 - Nondeterministic Finite State Automata (cont.)
Lecture 11 - Nondeterministic Finite State Automata with Epsilon-Moves
Lecture 12 - Equivalence between FSA and Type 3 Grammars
Lecture 13 - Regular Expressions, Regular Expressions to NFSA
Lecture 14 - DFSA to Regular Expressions
Lecture 15 - Problems and Solutions I
Lecture 16 - Pumping Lemmas for Regular Sets and CFL
Lecture 17 - Myhill-Nerode Theorem
Lecture 18 - Minimization of DFSA
Lecture 19 - FSA with Output Moore and Mealy Machines
Pushdown Automata
Lecture 20 - Pushdown Automata
Lecture 21 - Pushdown Automata, Equivalence between Acceptance by Empty Store and Acceptance by Final State
Lecture 22 - Pushdown Automata CFG to PDA
Lecture 23 - Pushdown Automata PDA to CFG
Problems and Solutions
Lecture 24 - Problems and Solutions II
Lecture 25 - Problems and Solutions III
Turing Machines
Lecture 26 - Turing Machines
Lecture 27 - Turing Machines (cont.)
Lecture 28 - Turing Machines as Acceptor, Techniques for Turing Machine Construction
Lecture 29 - Generalized Versions of Turing Machines
Lecture 30 - Turing Machine as a Generating Device
Decidability
Lecture 31 - Recursive Sets, Recursively Innumerable Sets, Encoding of TM, Halting Problem
Lecture 32 - Problems and Instances, Universal TM, Decidability
Lecture 33 - Rice's Theorem, Linear Bounded Automata, Problems of TM
Lecture 34 - Post's Correspondence Problems
Introduction to Complexity Theory
Lecture 35 - Post's Correspondence Problems (cont.), Time and Tape Complexity of TM
Lecture 36 - NP-Complete Problems, Cook's Theorem
Lecture 37 - NP-Complete Problems (cont.)
Advanced Topics
Lecture 38 - Regulated Rewriting
Lecture 39 - L-Systems
Lecture 40 - Grammar Systems
New Paradigms of Computing
Lecture 41 - DNA Computing
Lecture 42 - Membrane Computing