Problem $5$: $(20$ pts$)$

Construct the Mealy machine's transition table that is equivalent to following sequential circuit.

Extra Credit: $(10$ pts$)$

Given a $TG$ called $T{G}_1$ that accepts language $L_1,$ another $T{G}_2$ that accepts a language $L_2$ and another $T{G}_3$ that accepts a language $L_3,$ show how can we build another $TG$ that accepts $L_1*L_2+L_3,$ which means a word from $L_1$ con$1$ HW$2.$pdf jith a word from $L_2$ or a word from $L_3$