The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
313 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?

in Theory of Computation by (223 points)
edited by | 313 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

1 Answer

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

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,830 questions
54,802 answers
189,506 comments
80,732 users