This is based off of my question here, where I was helped to find the number of Turing machines with restricted states and characters which is $(3(c+1)(n+2))^{(c+1)n}$. Now I'm wondering how many of those are unique, when I asked on IRC it was suggested that most of them are duplicates. Unique and valid in this case means that it is the only Turing machine included that when given the specific input terminates with the same tape, same position, and in the same accepting/rejecting state. Valid means they will accept/reject at some point regardless of input.
Some ideas I had to limit it are that some states might be unreachable and hence simplify down to one with less states. This reduces it by $$(3(c+1)(n+1))^{(c+1)(n-1)}$$ different machines. This is true because for each machine one state smaller you can effectively leave it as is, just modify it by adding $c+1$ new transitions from a new state. Since you didn't modify any of the other states this is unreachable and won't affect execution, therefore they are functionally equivalent. The reason this won't apply to all below it is that they are included in the count for $n-1$. If they were padded to $n$ states and they started with $i < n-1$ states they would have to have $n-1$ states somewhere along the line as they were building up and therefore already be included.
Are there any other ways to remove equivalent programs?
