retagged by
747 views
1 votes
1 votes

In the deciadability chart mentioned on http://gatecse.in/grammar-decidable-and-undecidable-problems/

The undecidable problems mentioned here are semidecidable(RE but not REC) not NOT RE.Or there is no such relation?

Can someone have a look and tell please?

retagged by

2 Answers

0 votes
0 votes

Hi there,

Although I haven't encountered any semi-decidability related problems in my preparation (GATE '18) yet, I googled for the same after reading your question. Hope the following link helps,

http://cs.stackexchange.com/questions/19641/can-a-semi-decidable-problem-be-also-decidable

I will update this answer if I can clarify your doubt precisely.

Related questions

0 votes
0 votes
0 answers
3
aditi19 asked Oct 29, 2018
248 views
A recursive language is empty or a recursive language contains all strings over sigma*. Why this problem is undecidable?
0 votes
0 votes
0 answers
4
sushmita asked Dec 23, 2016
395 views
While applying decidability theorem, can we only apply this theorem to undecidable problems or can we also apply them to recursively enumerable ie semidecidablle problems...