edited by
573 views
0 votes
0 votes
1.  I know that whether a cfg generates regular language is undecidable ....
somone plzz help me to prove that
whether a given cfl is regular language also undecidable ....
2.  how equvilance problem on 2 dcfl is decidable??
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
3
Na462 asked Jan 21, 2019
713 views
0 votes
0 votes
0 answers
4
Ayush Upadhyaya asked Jan 13, 2019
403 views
From http://www.cs.rice.edu/~nakhleh/COMP481/final_review_sp06_sol.pdf $L_{26}=\{<M>|$ M is a TM such that both L(M) and $\lnot L(M)$ are infinite $\}$I was unable to get...