MadeEasy Subject Test: Theory of Computation - Identify Class Language

Question

In the given two diagrams one from made easy and another from KLP Mishra book.

(1) in this diagram, type 3 or regular language  and its related automata is Finite Automaton.

(2) in this diagram, Finite Automaton is both for Regular or type3 and Context-free or type2. corresponding arrow is connected with context-free box.

(1) Diagram

(2) Diagram

So what is the correct relations among languages and the corresponding automata?

Comments

Please don't refer KLP Mishra, it has many errors. Follow some standard book, like Ullman or Peter Linz.

---

print mistake in diagram 2

---

Print Mistake in 2nd Diagram. First One is Correct.