Discussion
The Thompson construction converts
Answer: B
Correct answer: a regular expression into a nondeterministic finite automaton
Thompson’s construction builds an NFA piece by piece from the structure of the expression, giving each operator - union, concatenation, closure - a small fixed pattern of states joined by epsilon transitions. The result is nondeterministic; the subset construction is the separate step that makes it deterministic, and minimisation a third.
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