Register

Chomsky hierarchy

832 views

1 Answer

Best answer
1 1 vote

All the points mentioned are true.

Also from the given diagram, one point to note is:

Regular languages $\subset$ CFLs $\subset$ CSLs $\subset$ Recursive languages $\subset$ Recursively Enumerable languages

• selected by
Voting & Accepting an answer helps improve the community
← Previous · Basic 3NF doubt .Next → · Compiler parser
← Previous in category · TOC PDANext in category → · turing machine
Position:
Show:

Related questions

0 0 votes
1 1 answer
73
73 views
GO Classes asked Sep 24
73 views
GO Classes DPP | GATE CS | Theory of Computation | Chomsky Hierarchy
Let $L$ be a context-free language that is not regular.Which of the following must be true?$L$ is recursive. $L$ is not recursive. There exists a regular grammar $G$ such...
1 1 vote
0 0 answers
467
467 views
RahulVerma3 asked Jun 6, 2024
467 views
Theory of Computation | Chomsky Hierarchy
A general query,If Regular expression (a+b)* covers the all possible languages over $\sum$= {a,b} then, why we need other type of languages?Are they here only to distingu...
1 1 vote
2 2 answers
1.9k
1.9k views
rahul sharma 5 asked Nov 20, 2017
1,861 views
TOC:- Chomsky hierarchy
Where does NP hard / NP complete problems fits in the Chomsky hierarchy ? Is there any relation of Np hard problems with RE languages?
2 2 votes
1 1 answer
862
862 views
Xylene asked Jan 30, 2017
862 views
Basic Doubt Chomsky Hierarchy
I know that if L1 is regular and L2 is CFL then L1 intersection L2 is always CFL. But if we go according to hierarchy then if L1 is regular then it should be CFL so L1 in...