4. (10 pts) Consider the problem of testing whether a machine has a redundant state, that is, one that is not reachable on an

Does a TM have a redundant state?

4. (10 pts) Consider the problem of testing whether a machine has a redundant state, that is, one that is not reachable on any input string. Assume the alphabet is 0,1, convert this problem into a problem of testing membership in a language and determine whether the the language is decidable, undecidable, T-recognizable, co-T-recognizable, not T-recognizable:



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *