Theory of Computation In PowerPoint

  Introduction
  Finite Automata
  Regular Expressions
  Regular Language Properties
  Midterm I review
  Context Free Grammars and Languages
  Pushdown Automata
  Context-Free Language Properties
  pumping lemma class exercises 1
  pumping lemma class exercises 3
  pumping lemma class exercises 4
  Example for the substitution closure property proof
  Turing Machines
  Undecidability
  Course & Finals Review


© 2014 Design by w3layouts