The diagram in KLP Mishra has a design mistake. Finite State Machines are capable of accepting only Regular Languages.

The Gateway to Computer Science Excellence

+1 vote

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?

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.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,741 questions

57,243 answers

198,012 comments

104,604 users