edited by
310 views
0 votes
0 votes

L is decidable or undecidable??

edited by

1 Answer

2 votes
2 votes

According to Rice's  Theorem

Any non-trivial property of the LANGUAGE recognizable by a Turing machine is undecidable

For a property to be non-trivial, there should exist at least two Turing machines, the property holding for the language of one

Tyes and not holding for the language of other Tno.

So we can make Turing machine for L and L' in this question,so it is undecidable.

No related questions found