Discussion
The intersection of two regular languages is recognised by
Answer: A
Correct answer: the product automaton formed from the two deterministic machines
The product automaton has one state for each pair of states of the two originals and runs them side by side on the same input, accepting only when both would accept. Making the accepting condition “either” instead of “both” gives the union by the same construction, which is one way of showing regular languages closed under both.
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