Turing machines with read-only stack and two stacks

226 Views Asked by At

I am new to turing machines. I am stuck at how to prove this problem?

Consider we have only read-only tape and two stacks. Prove that this machine can accept PDA, NPDA and normal Turing machines with one tape.

Any help would be appreciated.