Section outline

  • Basic Concepts and Automata Theory: Introduction to Theory of Computation- Automata,      Computability and Complexity,      Alphabet,      Symbol,      String,      Formal Languages,      Deterministic Finite Automaton (DFA)- Definition,      Representation,      Acceptability of a String and Language,      Non Deterministic Finite Automaton (NFA),      Equivalence of DFA and NFA,      NFA with ε-Transition,      Equivalence of NFA’s with and without ε-Transition,      Finite Automata with output- Moore Machine,      Mealy Machine,      Equivalence of Moore and Mealy Machine,      Minimization of Finite Automata