The Gateway to Computer Science Excellence
0 votes
  1. Equivalence of 2 CFL's is decidable or not?
  2. Equivalence of 2 Regular languages is decidable or not?
  3. Equivalence of 2 CSL is decidable or not?
  4. Equivalence of 2 Recursive languages is decidable or not?
  5. Equivalence of 2 DPDA's is decidable or not?
  6. Equivalence of 2 PDA's is decidable or not?


in Theory of Computation by Boss (36.5k points) | 91 views
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.

Only 2 is decidable and Rest is Undecidable.

Oh right, I forgot the whole Godel prize story behind 5.

1 Answer

+2 votes
Equivalence of regular and dcfls are decidable and for the rest of the languages it is undecidable.
by (167 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
50,737 questions
57,333 answers
105,200 users