0 votes 0 votes Which one of the following problems is decidable for recursive languages $(L)$ ? Is $L= \phi$ ? Is $w \in L$, where $w$ is a string ? Is $L= \Sigma ^*$ ? Is $L=R$, where $R$ is a given regular set ? Unknown Category ugcnetcse-dec2018-paper2 + – Arjun asked Jan 2, 2019 edited Jun 22, 2020 by soujanyareddy13 Arjun 906 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Satbir commented Dec 25, 2018 reply Follow Share 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 votes 0 votes Hemanth_13 commented Dec 25, 2018 reply Follow Share Yes only membership, so option 2 0 votes 0 votes Shaik Masthan commented Jan 2, 2019 reply Follow Share Only membership problem is decidable for Recursive languages ref : https://gatecse.in/grammar-decidable-and-undecidable-problems/ 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes Recursive language decidable only on membership and complementation Membership property only given in option 2 Ram Swaroop answered Dec 25, 2018 Ram Swaroop comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Sumit Rana 1 answered Jun 17, 2019 Sumit Rana 1 comment Share Follow See all 0 reply Please log in or register to add a comment.