1 is undecidable, as a consequence of which, 6 is also undecidable. 2 is decidable. I'm not sure about 5, but I think it should also be undecidable as we can create a CFG for every DPDA.

The Gateway to Computer Science Excellence

0 votes

- Equivalence of 2 CFL's is decidable or not?
- Equivalence of 2 Regular languages is decidable or not?
- Equivalence of 2 CSL is decidable or not?
- Equivalence of 2 Recursive languages is decidable or not?
- Equivalence of 2 DPDA's is decidable or not?
- Equivalence of 2 PDA's is decidable or not?

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.4k
- 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.1k
- Non GATE 1.4k
- Others 1.7k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,666 questions

56,167 answers

193,838 comments

94,010 users