Wikipedia:Articles for deletion/Read-only right-moving Turing machines

The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.

The result was speedy keep. Nomination withdrawn. (non-admin closure) Caleb Stanford (talk) 19:42, 4 July 2022 (UTC)[reply]

Read-only right-moving Turing machines (edit | talk | history | protect | delete | links | watch | logs | views) – (View log | edits since nomination)
(Find sources: Google (books · news · scholar · free images · WP refs· FENS · JSTOR · TWL)

This is identical to Deterministic finite automaton and only serves to confuse; should be merged there. Caleb Stanford (talk) 16:08, 4 July 2022 (UTC)[reply]

  • Withdrawn by nominator OK, I guess this was not an appropriate use of AfD. This is a clear merge (was discussed before on the talk page). I completed the merge and this AfD should be closed. Caleb Stanford (talk) 19:40, 4 July 2022 (UTC)[reply]
The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.