Discussion
Language of finite automata is
Answer: D
The language of finite automata is Type 3.
In the Chomsky hierarchy, Type 3 grammars generate the regular languages, which are exactly the languages accepted by finite automata.
Type 2 (context-free) languages need pushdown automata, Type 1 (context-sensitive) languages need linear bounded automata, and Type 0 (recursively enumerable) languages need Turing machines.
The correspondence runs: Type 3 with finite automata, Type 2 with pushdown automata, Type 1 with linear bounded automata and Type 0 with Turing machines.
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