Discussion
The minimal DFA for a regular language is
Answer: D
Minimisation yields a canonical machine. This uniqueness is what makes it possible to test two regular expressions for equivalence by minimising both automata and comparing the results. No comparable canonical form exists for context free grammars, which is why equivalence there is undecidable.
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