GATE | GATE CS 1996 | Question 60

Given below are the transition diagrams for two finite state machine M1 and M2 recognizing languages L1 and L2 respectively.

fa1

 



 

 

 

 

 

 

.

a) Display the transition diagram for a machine that recognizes L. L2, obtained from transition diagrams for M1 and M2 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 (L1.L2) by adding only ε transitions and no new states.
(Final states are enclosed in double circles).


Answer:

Explanation:

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.