Register

Equivalence and Emptiness problems in RE

534 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Mk Utkarsh asked Nov 20, 2018
632 views
Equivalence Problems
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?
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 lang...
User Avatar
0 votes
0 votes
0 answers
2
garimanand asked Sep 18, 2018
172 views
MadeEasy Test Series: Theory Of Computation - Recursive and RE Languages
how can l2 be a recursive language we have two turing machines both can accept one language but it does not imply whether it halts or not
how can l2 be a recursive language we have two turing machines both can accept one language but it does not imply whether it halts or not
User Avatar
0 votes
0 votes
0 answers
3
Rajesh R asked Dec 8, 2017
612 views
Difference between Co-RE and Non RE language.
Can someone please tell me the difference between Non R.E and CoRE language ?
Can someone please tell me the difference between Non R.E and CoRE language ?
User Avatar
Link Copied!