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.
So what is the correct relations among languages and the corresponding automata?
I mistook the label of images. Fixed my comment. Doesn't change the fact anyway. Refer this Wikipedia page, if that is confusing you.
Refund time depends on the payment mode --...