Mathematical Foundation of Computer Science

(Chris Devlin) #1

EQUIVALENCE OF


NFA AND DFA


8.1 Relationship between NFA & DFA................................................................................


8.2 Method of Conversion from NFA to DFA
8.3 Finite Automata with ∈ moves
8.3.1 NFA with ∈ moves
8.3.2 δ∈-head
8.3.3 Language of NFA with ∈ moves
8.3.4 M ethod of conversion from NFA with ∈ moves to NFA

8.3.5 Equivalence of NFA with ∈-moves to DFA.......................................................

Exercises
Free download pdf