Talk:Read only right moving Turing Machines

From Wikipedia, the free encyclopedia

The chart is not very friendly to read. I would like to create a diagram generated by this machine to see it like a finite state machine. Then potentially generate a finite automata accepting the equivelant language. Then specify an equivalent regular expression using Kleene's notation. Examples strings over the {0,1} alphabet would also be relevant.

--Steven Viemeister - rtisbute 03:44, 18 July 2007 (UTC)

I'd like to know how this model is relevant next to a simple DFA? They are both computationally and functionally equivalent, unless I'm missing something. I would like to see a section on applications of the model if there are any beyond a DFA. Otherwise, I would recommend a merger with Turing machine or Read-only Turing machine SamuelRiv 04:29, 10 November 2007 (UTC)