Question

Can someone please explain to me how you get from the first table to the second table. Thanks!

Constructing Efficient Finite Automata Write in simplified form after renumbering the states: b Тр а S, F 0,3 3 0,1,3 {3} F (0, 1,32,3} (0,1,3 3) 3} {2,3 {2} (2} F F (2)

Answer 1

HAPPY TO HELP!

HERE IN THE FIRST FIGURE, Td is representing the starting point, and 'a' and 'b' shows the corresponding paths.

Where there is 'phi' written, that means no path.

Here, the arrow shows the starting position, whereas the concentric circles shows the end point of the path.

When we have created the second table with the help of above facts, now again we have to create a table.Now this table is generated with the help of previous diagram.

The second table will help us build the final stage of the answer.

In this last diagram, first we have to write the starting position, that is zero in this case(do note that it is also the final state as there are concentric circles), then according to the values from second table, we keep on creating the desired path.

Also if any node is redirecting to itself, then we use arrows on that node itself.

HOPE I WAS HELPFUL.