Pumping lemma for context-free languages (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Pumping lemma for context-free languages" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
274th place
309th place
8,379th place
5,202nd place
1,923rd place
1,068th place
1,734th place
1,312th place
6th place
6th place

archive.org

core.ac.uk

doi.org

  • Kreowski, Hans-Jörg (1979). "A pumping lemma for context-free graph languages". In Claus, Volker; Ehrig, Hartmut; Rozenberg, Grzegorz (eds.). Graph-Grammars and Their Application to Computer Science and Biology. Lecture Notes in Computer Science. Vol. 73. Berlin, Heidelberg: Springer. pp. 270–283. doi:10.1007/BFb0025726. ISBN 978-3-540-35091-0.
  • Stephen Scheinberg (1960). "Note on the Boolean Properties of Context Free Languages" (PDF). Information and Control. 3 (4): 372–375. doi:10.1016/s0019-9958(60)90965-7. Here: Lemma 3, and its use on p.374-375.

luc.edu

webpages.math.luc.edu

springer.com

link.springer.com

  • Kreowski, Hans-Jörg (1979). "A pumping lemma for context-free graph languages". In Claus, Volker; Ehrig, Hartmut; Rozenberg, Grzegorz (eds.). Graph-Grammars and Their Application to Computer Science and Biology. Lecture Notes in Computer Science. Vol. 73. Berlin, Heidelberg: Springer. pp. 270–283. doi:10.1007/BFb0025726. ISBN 978-3-540-35091-0.

zbmath.org