378 views

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
1 1 answer
45
45 views
GO Classes asked 6 days ago
45 views
Select all the true statements.Recognizable languages are closed under complement. Decidable languages are closed under complement. Recognizable languages are closed unde...
0 0 votes
0 0 answers
575
575 views
surbhijain93 asked Sep 9, 2018
575 views
Is there any relationship b/w closure and decidability?Thanks
4 4 votes
0 0 answers
757
757 views
Chhotu asked Nov 19, 2017
757 views
Hi Guys,If someone can provide proof or some kind of intuition for following properties then it will be great help. Because many problem could be solved via these two tab...
0 0 votes
1 answers 1 answer
1.3k
1.3k views
Rahul Jain25 asked Feb 7, 2017
1,309 views
I) L-R where L is DCFl and R is regular. Is L-R also DCFL decidable or not???II)If L1 is reducible to L2 and L2 is non-RE then L1 is also Non-RE??? III) If L1 is reducibl...