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.

M₁ starts at accepting state A and also has state B; M₂ starts at accepting state C, has accepting state D, and nonaccepting state E. The labelled transitions are shown in the diagram.

(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 free

Explore the full course: Zero To Hero

Loading lesson…