'Initial mark test' presentation slideshows

DFA Minimization

DFA Minimization. Equivalent States. Consider the accept states c and g. They are both sinks meaning that any string which ever reaches them is guaranteed to be accepted later. Q: Do we need both states?. 0,1. 0. b. c. 1. 0. 0,1. 0. 1. a. d. e. 0,1. 1. 1. 0. f. g.

1.58k views • 36 slides

DFA Minimization: The Idea

477 views • 20 slides