Talk:Read-only right-moving Turing machines
Latest comment: 1 year ago by Caleb Stanford in topic Result of AfD
 | This article was nominated for deletion on 4 July 2022. The result of the discussion was speedy keep (merge instead). |
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)
- I think the main point of the model is to illustrate that a Turing machine is trivially a DFA. I think it would be better to include this as a segment at the end of the DFA article, with a link to Turing Machines, since this is really an alternate formulation of a DFA.Flying Bishop (talk) 18:26, 25 September 2009 (UTC)
Result of AfD edit
Improper use of AfD because the goal was to merge the content (see discussion above), not delete. Speedy keep as a result and merging content to Deterministic finite automaton. Caleb Stanford (talk) 19:36, 4 July 2022 (UTC)