Discussion
A DFA has 6 states and an input alphabet of 26 characters. How many entries does the uncompressed transition table contain?
Answer: B
Correct answer: 156
The uncompressed table has one entry for each combination of state and input character: \[ 6 \times 26 = 156. \] The product form is why table compression matters in practice: a realistic scanner has hundreds of states over an alphabet of 128 or 256 characters, and character classes are used precisely to keep that product manageable.
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