Discussion
The given FSM :
is equivalent to :
Answer: B
The machine is equivalent to 0*1 (0 + 1).
Trace the paths from the start state a1 to the final state a3. The self-loop on a1 reads any number of 0s, giving 0*. The only way out of a1 is on 1, giving 1. From a2 one more symbol, 0 or 1, reaches a3, giving (0 + 1). So the language is 0*1(0 + 1).
1*0(0 + 1) swaps the roles of 0 and 1. 01*(0 + 1) and 00*(0 + 1) would need a loop on 1 or require at least one leading 0, neither of which the machine has.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development