Wikipedia:Articles for deletion/Interchange lemma for context-free languages

Source: Wikipedia, the free encyclopedia.
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 keep. Reliable sources that support this subject have been presented during the AfD discussion. (non-admin closure) Steve Quinn (talk) 04:59, 14 March 2019 (UTC)[reply]

Interchange lemma for context-free languages (edit | talk | history | protect | delete | links | watch | logs | views) – (View log · Stats)
(Find sources: Google (books · news · scholar · free images · WP refs· FENS · JSTOR · TWL)

No coverage in independent third party sources. No demonstration of notability. Steve Quinn (talk) 02:21, 11 March 2019 (UTC)[reply]

Note: This discussion has been included in the list of Language-related deletion discussions. Icewhiz (talk) 08:19, 11 March 2019 (UTC)[reply]
Note: This discussion has been included in the list of Computing-related deletion discussions. Icewhiz (talk) 08:19, 11 March 2019 (UTC)[reply]
  • Keep It can be also found in the standard textbook for the field, A Second Course in Formal Languages and Automata Theory by Jeffrey Shallit. domotorp
  • Comment. Based on the above responses I will withdraw this AfD. I will also try to move the page to "Interchange lemma". I won't have time to do it right now - but within 18 hours. If someone else wants to close this AfD then please feel free to do so. I think the outcome is pretty clear. Steve Quinn (talk) 03:55, 14 March 2019 (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.