Theory of Automata, Formal Languages and Computation

Add to Buffet

Save course to Your Buffet - Get notified, Track Progress, Plan Future Learning.
9 People Have this course in their Buffet

Theory of Automata, Formal Languages and Computation

Course Description:

Introduction to Grammars, Languages generated, Chomskian Hierarchy, CFG, Ambiguity, Reduced grammars, Normal forms; FSA,NFSA, NFSA with € moves, Regular expressions, Equivalence of regular expression and FSA, Equivalence of type 3 grammars and FSA, Pumping lemma , Closure and decidability results , Myhill- Nerode theorem, Minimization, FSA with output, Problems

  • Instructor(s) Kamala Krithivasan
  • University
  • Provider
  • Start Date Always Available
  • Duration Always Available
  • Main Language English
Did you find any errors in this course listing ? Help us improve and we would be eternally grateful

Related Courses

Other Computer Science Courses

Course Reviews

  • No Comments Yet! Be the first one to comment.