GATE | GATE CS 1996 | Question 60

Given below are the transition diagrams for two finite state machine M₁ and M₂ recognizing languages L₁ and L₂ respectively.

.

a) Display the transition diagram for a machine that recognizes L₁ . L₂, obtained from transition diagrams for M₁ and M₂ by adding only ε transitions and no new states.

b) Modify the transition diagram obtained in part(a) 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).


Answer:

Explanation:

Quiz of this Question