Register

Chomsky hierarchy

536 views

1 Answer

Best answer
1 votes
1 votes

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
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
rahul sharma 5 asked Nov 20, 2017
1,257 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?
Where does NP hard / NP complete problems fits in the Chomsky hierarchy ? Is there any relation of Np hard problems with RE languages?
User Avatar
1 votes
1 votes
0 answers
3
Hira Thakur asked Aug 29, 2016
272 views
chomsky hierarchy
the language generate by the grammer S→SS/aSb/ab is accepted by___ a. DPDA b.PDA c.LBA d turing machine 1. D>C>B>A 2. A>B>C>D 3. B>D>A>B 4. D>A>B>C
the language generate by the grammer S→SS/aSb/abis accepted by___a. DPDAb.PDAc.LBAd turing machine1. D>C>B>A2. A>B>C>D3. B>D>A>B4. D>A>B>C
User Avatar
0 votes
0 votes
1 answer
4
bts1jimin asked Sep 13, 2018
924 views
Chomsky normal form in Syllabus?
Is chomsky normal form and greibach normal f in syllabus?
Is chomsky normal form and greibach normal f in syllabus?
User Avatar
Link Copied!