Discussion
DFA minimisation partitions the states by
Answer: C
Correct answer: grouping states that cannot be distinguished by any input string
Two states are equivalent when no input string leads from one to acceptance and from the other to rejection, so nothing outside can tell them apart. Minimisation refines a partition until each block contains only mutually indistinguishable states and then collapses each block to a single state. Accepting and non-accepting states are distinguishable by the empty string and never merge.
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