Week 8&9: NFA With ^ Transitions
Download Files
Course Material
- Week 1: Introduction
- Week 2: Regular Languages & Expressions
- Week 3: Finite Automta
- Week 4&5: Union, Intersection & Complement of FAs
- Week 6&7: Non Deterministic Finaite Automata
- Week 8&9: NFA With ^ Transitions
- Week 12: Equivalence of States
- Week 13: Context Free Grammars
- Week 14: Chomsky Normal Form
- Week 15: Cocke–Younger–Kasami algorithm
- Week 16: Push Down Automata
- Week 17: Turing Machine
- Course Outline & Description
- Chapters 13
- Department CS & IT
- Teacher
Dr. Qaiser Abbas
