Open In App

GATE | GATE CS 1996 | Question 60

Improve
Improve
Like Article
Like
Save
Share
Report

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 L1 . 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


Last Updated : 06 Nov, 2017
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads