My Account

Forgot Your Password?
logo
  • Home
  • Courses
  • Faculty
  • Contact
  • Go to Main Website
  • LogIn
Logo
  • Home
  • Courses
  • Faculty
  • Contact
  • Go to Main Website
  • LogIn

Theory of Automata and Formal Languages

Theory of Automata and Formal Languages

The course introduces students with fundamental concepts of automata theory and formal languages to form basic models of computation which provide foundation of many branches of computer science, e.g. compilers, software engineering, concurrent systems, etc.

Course Material

01 Week 1: Introduction
Go >
02 Week 2: Regular Languages & Expressions
Go >
03 Week 3: Finite Automta
Go >
04 Week 4&5: Union, Intersection & Complement of FAs
Go >
05 Week 6&7: Non Deterministic Finaite Automata
Go >
06 Week 8&9: NFA With ^ Transitions
Go >
07 Week 12: Equivalence of States
Go >
08 Week 13: Context Free Grammars
Go >
09 Week 14: Chomsky Normal Form
Go >
10 Week 15: Cocke–Younger–Kasami algorithm
Go >
11 Week 16: Push Down Automata
Go >
12 Week 17: Turing Machine
Go >
13 Course Outline & Description
Go >
  • Total Lessons 13
  • Department CS & IT
  • About Visit Profile
  • Teacher Dr. Qaiser Abbas
Other Courses by Dr. Qaiser Abbas
  • Advance Analysis of Algorithms
  • Capstone Project I
  • Artificial Intelligence (CS-3811)
logo

We take our mission of increasing global access to quality education seriously.

Developed by: Adeel Hassan, Directorate of IT, University of Sargodha