00:02
We are given sets and we are asked to construct non -deterministic finite state automata and recognize each of these sets.
00:17
So the first set we're given is the set containing lambda and the string 0.
00:28
Let s -0 be the start state.
00:41
Then the machine should accept the empty string lambda, so s -0 should be a final state.
00:53
If the input is a zero, then we'll move on to another final state, since zero should be accepted.
00:57
Called this final state s1.
01:19
And from this we've obtained a nondeterministic finite state automaton that will recognize the strings, lambda, and 0, but no other strings.
01:31
In part b, we're given the set 011.
01:43
Now, let s0 be a start state.
01:47
Since the empty string lambda should not be recognized, it follows that s0 should be a non -final state.
01:57
Now, if the first is a final state, input is a 0, then we'll want to move from s0 to a final state, s1, because 0 should be accepted by the machine.
02:22
Now, if instead first input is a 1, then we'll move from s0 to a non -final state, s2.
02:40
You don't remain at s0 because this would imply that any string with, which is a sequence of ones, should not be accepted while 1 -1 should be accepted.
03:03
Now suppose that the next input is a 1...