UGC NET CS 2009-June-Paper-2
October 18, 2023Compiler-Design
October 18, 2023Compiler-Design
Question 6 |
Given below are the transition diagrams for two finite state machine M1 and M2 recognizing languages L1 and L2 respectively.
(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).
Theory Explanation. |
Correct Answer: A
Subscribe
Login
0 Comments