"pumping lemma" meaning in All languages combined

{
  "forms": [
    {
      "form": "pumping lemmas",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "pumping lemmata",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "s",
        "2": "pumping lemmata"
      },
      "expansion": "pumping lemma (plural pumping lemmas or pumping lemmata)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Terms with Icelandic translations",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1997, Dexter Kozen, Automata and computability, page 148:",
          "text": "There is a pumping lemma for CFLs similar to the one for regular sets. It can be used in the same way to show that certain sets are not context-free.",
          "type": "quote"
        },
        {
          "ref": "2002, Alejandro Maass, Servet Martínez, Jaime San Martín, Dynamics and randomness, page 174:",
          "text": "In the literature one finds many pumping lemmas which describe the ability to repeat (pump) certain words repeatedly in some languages, under different circumstances.",
          "type": "quote"
        },
        {
          "ref": "2010, Marco Kuhlmann, Dependency Structures and Lexicalized Grammars: An Algebraic Approach, page 107:",
          "text": "String-language hierarchies are usually proven using formalism-specific pumping lemmata.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular)."
      ],
      "id": "en-pumping_lemma-en-noun--eMziTCE",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "lemma",
          "lemma"
        ],
        [
          "sufficiently",
          "sufficiently"
        ],
        [
          "language",
          "language"
        ],
        [
          "regular",
          "regular"
        ]
      ],
      "raw_glosses": [
        "(computer science) A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular)."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "translations": [
        {
          "code": "is",
          "lang": "Icelandic",
          "sense": "lemma stating that a section of a string can be removed or repeated with the resulting string remaining in the language",
          "tags": [
            "feminine"
          ],
          "word": "dælusetning"
        }
      ],
      "wikipedia": [
        "pumping lemma"
      ]
    }
  ],
  "word": "pumping lemma"
}

{
  "forms": [
    {
      "form": "pumping lemmas",
      "tags": [
        "plural"
      ]
    },
    {
      "form": "pumping lemmata",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "s",
        "2": "pumping lemmata"
      },
      "expansion": "pumping lemma (plural pumping lemmas or pumping lemmata)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "Quotation templates to be cleaned",
        "Terms with Icelandic translations",
        "en:Computer science"
      ],
      "examples": [
        {
          "ref": "1997, Dexter Kozen, Automata and computability, page 148:",
          "text": "There is a pumping lemma for CFLs similar to the one for regular sets. It can be used in the same way to show that certain sets are not context-free.",
          "type": "quote"
        },
        {
          "ref": "2002, Alejandro Maass, Servet Martínez, Jaime San Martín, Dynamics and randomness, page 174:",
          "text": "In the literature one finds many pumping lemmas which describe the ability to repeat (pump) certain words repeatedly in some languages, under different circumstances.",
          "type": "quote"
        },
        {
          "ref": "2010, Marco Kuhlmann, Dependency Structures and Lexicalized Grammars: An Algebraic Approach, page 107:",
          "text": "String-language hierarchies are usually proven using formalism-specific pumping lemmata.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular)."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "lemma",
          "lemma"
        ],
        [
          "sufficiently",
          "sufficiently"
        ],
        [
          "language",
          "language"
        ],
        [
          "regular",
          "regular"
        ]
      ],
      "raw_glosses": [
        "(computer science) A lemma which states that for a language to be a member of a language class any sufficiently long string in the language contains a section that can be removed or repeated any number of times with the resulting string remaining in the language, used to determine if a particular language is in a given language class (e.g. not regular)."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "pumping lemma"
      ]
    }
  ],
  "translations": [
    {
      "code": "is",
      "lang": "Icelandic",
      "sense": "lemma stating that a section of a string can be removed or repeated with the resulting string remaining in the language",
      "tags": [
        "feminine"
      ],
      "word": "dælusetning"
    }
  ],
  "word": "pumping lemma"
}