606 views
0 votes
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?

 

1 Answer

Related questions

0 votes
0 votes
0 answers
1
rahul sharma 5 asked Jan 15, 2017
531 views
Please classify following as NOT RE and RE but Not REC1. Given L1 and L2 as RE languages,is L1=L2 ?2. L(M) accepts some String ?3.L(M) is empty?How can i prove these ques...
0 votes
0 votes
0 answers
2
baofbuiafbi asked Nov 14, 2023
142 views
Prove L = {F | F is a boolean formula and F evaluates to true on every asignment" is decidable (include algorithm and running time in big o notation)