AALL10 · Chapter 10Theory of Computation & Graphics🏛️ Past Licensure QuestionID: 1d58ef42
The language accepted by a finite automaton corresponds to which grammar type in the Chomsky classification?
The language accepted by a finite automaton corresponds to which grammar type in the Chomsky classification?
Multiple Choice Options
- A
Type 0
- B
Type 1
- C
Type 2
- D✓ Correct Option
Type 3
Detailed Technical Solution & Explanation
In the Chomsky language hierarchy, regular languages are generated by regular grammars (Type 3) and are recognized by Finite Automata (DFA and NFA). Context-free languages are Type 2, context-sensitive are Type 1, and recursively enumerable languages are Type 0.
Option Analysis:
•
Option A (Type 0): Recognized by Turing Machines.
•
Option B (Type 1): Recognized by Linear Bounded Automata.
•
Option C (Type 2): Recognized by Pushdown Automata.
•
Option D (Type 3): Correct. Finite Automata accept exactly the regular languages (Type 3 grammars).
Reference: Mock Test 05NEC Licensure Syllabus