• Finite Automaton
  • Memory needed to recognize a language
  • Minimization of an FA
  • Finite Automata: Definition
  • Transition on Strings
  • Acceptance
• Nondeterministic Finite Automata (NFA)
  • Definition of NFA
  • Transition on Strings
  • Extension to a Set of States
  • Equivalence of DFA and NFA
  • Conversion of NFA to DFA
• NFA with -moves
  • Extension of to strings
  • Extension of to set of states
• Equivalence of NFA and NFA with -transitions
  • Example
• Equivalence of FA with Regular Expressions
• Equivalence of DFA & Regular Expression
• Finite Automata with Output
  • Moore:
  • Mealy:
  • Example for Mealy M/C
• About this document ...