+1 vote
325 views

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?

edited | 325 views
0
The diagram in KLP Mishra has a design mistake. Finite State Machines are capable of accepting only Regular Languages.
0
But the diagram in KLP Mishra say that FA are also capable of accepting CFL. see carefully diagram FA arrow meet with CFL box.
0

I mistook the label of images. Fixed my comment. Doesn't change the fact anyway. Refer this Wikipedia page, if that is confusing you.

0
Please don't refer KLP Mishra, it has many errors. Follow some standard book, like Ullman or Peter Linz.
0
print mistake in diagram 2

Print Mistake in 2nd Diagram. First One is Correct.
by Boss (27.2k points)