Interview Preparation
- Interview Preparation For Software Developers
- Must Coding Questions - Company-wise
- Must Do Coding Questions - Topic-wise
- Company-wise Practice Problems
- Company Preparation
- Competitive Programming
- Software Design-Patterns
- Company-wise Interview Experience
- Experienced - Interview Experiences
- Internship - Interview Experiences
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.
.
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).
.
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
Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!
Last Updated :
Share your thoughts in the comments
GeeksforGeeks