Discussion
The complement of a regular language is
Answer: D
Correct answer: always regular, obtained by swapping accepting and non-accepting states
Take a complete deterministic automaton for the language and exchange its accepting and non-accepting states: the resulting machine accepts exactly the strings the original rejected. The construction requires the automaton to be deterministic and complete, with a transition defined for every state and character, which is why a dead state is added first if one is missing.
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