Wikipedia:Articles for deletion/Interchange lemma for context-free languages
- 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)
[Hide this box] New to Articles for deletion (AfD)? Read these primers!
- 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)
- Comment. The subject of this article has been covered in academic journals including SIAM Journal on Computing ([1]), Information Processing Letters ([2]), Theoretical Computer Science ([3]), and in the book Context-free Languages And Primitive Words. MarkZusab (talk) 02:51, 11 March 2019 (UTC)
- Weak keep Based on the abstracts of the articles provided by MarkZusab, it seems highly likely that these papers discuss the subject with significant depth. Unfortunately, I can't access the articles themselves to verify that. signed, Rosguill talk 03:12, 11 March 2019 (UTC)
- Note: This discussion has been included in the list of Language-related deletion discussions. Icewhiz (talk) 08:19, 11 March 2019 (UTC)
- Note: This discussion has been included in the list of Computing-related deletion discussions. Icewhiz (talk) 08:19, 11 March 2019 (UTC)
- Keep, but rename to Interchange lemma. Searching google-scholar for "Interchange lemma" I get a few full length articles + coverage in many other articles - and said coverage seems to be all in the content of context free languages. Icewhiz (talk) 08:22, 11 March 2019 (UTC)
- 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)
- 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.