Given below are the transition diagrams for two finite-state machines M₁ and…
PYQ GATE 1996
Given below are the transition diagrams for two finite-state machines M₁ and M₂ recognizing languages L₁ and L₂, respectively.

(a) Display the transition diagram for a machine that recognizes L₁L₂, obtained from the transition diagrams for M₁ and M₂ by adding only ε-transitions and no new states.
(b) Modify the transition diagram obtained in part (a) to obtain a transition diagram for a machine that recognizes (L₁L₂)* by adding only ε-transitions and no new states.
Final states are enclosed in double circles.
Sign up free to check your answer
Sign up freeLoading lesson…

