The Gateway to Computer Science Excellence
+1 vote
118 views

Image may contain: text

in Theory of Computation by Boss | 118 views
0
1. TOTALITY PROBLEM -> undecidable for recursive language.

2. MEMBERSHIP PROBLEM -> Decidable for recursive language.

3. EMPTINESS PROBLEM -> Undecidable for recursive language.

4. REGULARITY PROBLEM -> Undecidable for recursive language.

So, option 2. should be the answer
0
Yes only membership, so option 2

1 Answer

+1 vote
Recursive language decidable only on membership and complementation

Membership property only given in option 2
by Loyal

Related questions

+1 vote
1 answer
1
asked Dec 25, 2018 in Theory of Computation by Sanjay Sharma Boss | 140 views
0 votes
0 answers
2
asked Dec 25, 2018 in Compiler Design by Sanjay Sharma Boss | 78 views
+2 votes
1 answer
3
asked Dec 25, 2018 in Compiler Design by Sanjay Sharma Boss | 78 views
0 votes
2 answers
4
asked Dec 25, 2018 in Probability by Sanjay Sharma Boss | 120 views
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
52,217 questions
59,930 answers
201,126 comments
118,165 users