4. Consider the following nondeterministic finite automaton. a a b a b a b (a) Give...

Transcribed Image Text:

4. Consider the following nondeterministic finite automaton. a a b a b a b (a) Give a string beginning with a that is not accepted. (b) Construct an equivalent deterministic automaton using the sub- set construction. Assuming the states are named s, t, u, v from left to right, show clearly which subset of {s, t, u, v} corresponds to each state of the deterministic automaton. Omit inaccessible states. (The last statement means you should apply the lazy subset construction algorithm.) 4. Consider the following nondeterministic finite automaton. a a b a b a b (a) Give a string beginning with a that is not accepted. (b) Construct an equivalent deterministic automaton using the sub- set construction. Assuming the states are named s, t, u, v from left to right, show clearly which subset of {s, t, u, v} corresponds to each state of the deterministic automaton. Omit inaccessible states. (The last statement means you should apply the lazy subset construction algorithm.)