{"id":"https://openalex.org/keywords/pumping-lemma","display_name":"pumping lemma","description":"A pumping lemma is a theorem in formal language theory that describes repeatable structure in sufficiently long strings of certain language classes.","display_name_alternatives":["pumping lemmas"],"ids":{"openalex":"https://openalex.org/keywords/pumping-lemma","wikidata":"https://www.wikidata.org/wiki/Q1059648"},"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.8384,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.8384,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"works_count":575,"cited_by_count":5128,"works_api_url":"https://api.openalex.org/works?filter=keywords.id:keywords/pumping-lemma","updated_date":"2026-11-18T04:07:20","created_date":"2026-09-30T00:00:00"}
