Redirected
edited by
906 views
0 votes
0 votes

Which one of the following problems is decidable for recursive languages $(L)$ ?

  1. Is $L= \phi$ ?
  2. Is $w \in L$, where $w$ is a string ?
  3. Is $L= \Sigma ^*$ ?
  4. Is $L=R$, where $R$ is a given regular set ?
edited by

2 Answers

1 votes
1 votes
Recursive language decidable only on membership and complementation

Membership property only given in option 2
1 votes
1 votes
Only membership problem is decidable for Recursive languages
 w∈L, where w is a string, is closed
answer should be B

Related questions

1 votes
1 votes
0 answers
3
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,324 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$