Chapter 2: Introduction to Finite Automata — Theory of Computation (CSC262) Notes
Introduction to Finite Automata and Finite State Machines, Deterministic Finite Automata (DFA), Non-Deterministic Finite Automaton (NFA), Equivalence of DFA and NFA, Subset-Construction.
Notes Arriving Soon
Handwritten chapter notes for this subject are currently being digitized. Help your fellow students by contributing your notes!
Topics & Key Objectives in Chapter 2
Introduction to Finite Automata and Finite State MachinesDeterministic Finite Automata (DFA)Non-Deterministic Finite Automaton (NFA)Equivalence of DFA and NFASubset-Construction.