00:01
So, for the first part, the set of language recognized by this fsa is the set of all strings over the alphabet ab that start with an a and end with b.
00:30
In other words, it recognizes the language ab, aab, aaab and that's it.
00:40
Now, this next part, the transition table for this fsa is as follows.
00:46
It is state a, b, s1, s2, s2 and so on.
01:00
Now, next part, to build an equivalent fsa with reduced states, we can merge states that have same outgoing transitions.
01:22
So, in this case, we can merge states 1 and state 2 since they both have same outgoing transition on a to state s2.
01:34
The resulting fsa with reduced states would have two states that is s0 and s1 divided by s2.
01:44
Now, the next part, to prove that fsa in c is equivalent to the one given in the equation, we can show that they accept the same language.
01:54
They accept the same language.
01:58
They accept the same language...