Discussion
State whether the following is true or false.
Every regular expression describes a language that some finite automaton accepts.
Answer: A
Correct answer: True
This is one half of Kleene’s theorem: every language denoted by a regular expression is accepted by some finite automaton, and conversely. Thompson’s construction gives the automaton mechanically, and the subset construction then makes it deterministic. The equivalence is what allows a scanner generator to turn a specification into a program.
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