393 views

1 Answer

2 votes
2 votes
We can make every recursively enumerable language to follow this property by doing a little modification which is that we can add a useless state in case of TM with odd no of states due to which they will also have an even number of states. Hence for each of the recursively enumerable languages, we can have TM correspond to them having an even number of states thereby making it a trivial property.

Related questions

1 votes
1 votes
0 answers
1
Sumaiya23 asked Jan 23, 2018
428 views
What is monotonic and non-monotonic property. Please explain the second postulate of Rice's Theorem.