This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: state B from state A, and then consume the last three characters to end up at E. If the we don’t jump from state A to B on the fourth to last character, we can’t be accepted, and that jump can only occur if this character is an a, due to the transitions. 4. If an NFA has 20 states, what is the most number of states the corresponding equivalent DFA can have? Answer In the corresponding DFA, each state represents a subset of states from the NFA. Thus, the desired number is the maximum possible number of subsets of 20 items, which is 2 20 . Since the “null” state which corresponds to no possible output states doesn’t need to be drawn in most cases, 2 20 – 1, will also be accepted....
View Full Document
- Spring '08
- American record labels, maximum possible number, n’t start, corresponding equivalent DFA