00:04
We are given sets from i star where i is an alphabet, and we are asked to construct deterministic finite state automata.
00:14
We recognize each of these sets.
00:19
So, let i be an alphabet.
00:34
Now, our first set from i star is the empty set.
00:44
In other words, a set of no strings.
00:49
Now, let s -0 be the start state.
00:51
We know this exists because every finite state atomon has a start state.
00:59
Now, since the empty string should not be recognized by the machine, it follows that the start state should be a non -final state.
01:20
Now, suppose the first input is some element a from the alphabet, then we have that this string should not be accepted.
01:45
And so we'll want to remain at s -0, which is a non -final state, and it follows that the resulting deterministic finite -state automata will not recognize any strings.
02:08
And so you may want to draw the graph on your own.
02:12
Now in part b, we're given the set consisting of the empty string.
02:24
Once again, we know that this machine is going to have a start state s -0.
02:30
Now because lambda should be recognized the machine, it follows the s0 should be a final state.
02:42
That way, lambda will be recognized.
02:47
Now, suppose that the string contains at least one element.
02:58
So let the first input of a string be a for some a in the alphabet.
03:11
We want that the string should not be recognized by the machine...