Can you show me how to simulate Turing Machine with writing only on non-input fields on read-only Turing machine ?
I tried to do it be using internal states, but it provides me to infinitely many states, what is not allowed.
Any ideas ?
I consider standard Turing machines - one leftly-infinite tape.
read-only Turing machine is for me Turing machine such that it can't write on tape.
non-input fields - I mean part of tape where input is given. For example,
abcd#####...., machine can't overwrite
abcd but it can overwrite each
#. However, readonly can only read this tape, so no changes.
I am searching for solution in which we use functions and Myhill-Nerode theorem. Can anyone provide this kind of solution ?