I know that Finite Turing Machine and Regular Turing Machine are undecidable through Rice's theorem, but I may find a reduction among them?
Finite TM = {< M > | L(M) is finite on {a}}
Regular TM = {< M > | L(M) is regular on {a,b}}
I know that Finite Turing Machine and Regular Turing Machine are undecidable through Rice's theorem, but I may find a reduction among them?
Finite TM = {< M > | L(M) is finite on {a}}
Regular TM = {< M > | L(M) is regular on {a,b}}
Copyright © 2021 JogjaFile Inc.