Skip to main content

how How can I prove that the language of a read-only turingTuring machines is regular?

I find http://theory.stanford.edu/~trevisan/cs172/ps04.pdfthis, but I can't complete it, is there any other solution for it?

how can I prove that the language of a read-only turing machines is regular?

I find http://theory.stanford.edu/~trevisan/cs172/ps04.pdf, but I can't complete it, is there any other solution for it?

How can I prove that the language of a read-only Turing machines is regular?

I find this, but I can't complete it, is there any other solution for it?

Tweeted twitter.com/#!/StackCompSci/status/280309977535614977
Source Link

how can I prove that the language of a read-only turing machines is regular?

I find http://theory.stanford.edu/~trevisan/cs172/ps04.pdf, but I can't complete it, is there any other solution for it?