Whether you deal with paperwork day-to-day or only occasionally need them, DocHub is here to help you take full advantage of your document-based projects. This tool can change phrase in Conversion Agreement, facilitate user collaboration and create fillable forms and legally-binding eSignatures. And even better, everything is kept safe with the top security standards.
With DocHub, you can get these features from any location and using any device.
in this lecture we will be seeing another example of finding the regular expression for the given DFA so here we have another DFA given and then we have to find the regular expression for this DFA so here we say that we have states q1 q2 q3 and q4 where Q 1 is the initial as well as the final state and then we have inputs a and B so Ive already explained the steps to find the regular expressions from DFA in the previous lecture so here we will just solve it so first of all what we have to do is we have to write the equations for each of the states so lets start with q1 which is our initial s or s final state so how do we write first check what are the incoming transitions to q1 so this is an incoming transition coming from nowhere so this can be written as epsilon plus and here we see that from q2 there is an incoming transition with input B so we can write Q to be plus and then from q3 or so there is incoming transition to q1 with input a so I have to write q3 a and then there are n