Question

According to the Chomsky classification, language of finite automata is

• A. Type 0
• B. Type 1
• C. Type 2
• D. Type 3

Hint:

Type 3 = Regular languages = Recognized by finite automata (DFA/NFA).

Answer 1

The Correct Option is D

Type 3 languages are regular languages, which are accepted by finite automata. They are the simplest in Chomsky hierarchy.