Discussion
Simulating an NFA directly on an input of length n with m states costs roughly
Answer: B
Each input character requires computing the moves and epsilon closure of a set of at most m states. Converting to a DFA first trades construction time for scanning that costs only order n. For a scanner run on every compilation that trade is almost always worth making.
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