Pumping lemma
id:
pumping-lemma-294-7438444
title:
Pumping lemma
text:
In the theory of formal languages, the pumping lemma may refer to: Pumping lemma for regular languages, the fact that all sufficiently long strings in such a language have a substring that can be repeated arbitrarily many times, usually used to prove that certain languages are not regular
Pumping lemma for context-free languages, the fact that all sufficiently long strings in such a language have a pair of substrings that can be repeated arbitrarily many times, usually used to prove that certain
brand slug:
wiki
category slug:
encyclopedia
description:
Index of articles associated with the same name
original url:
https://en.wikipedia.org/wiki/Pumping_lemma
date created:
date modified:
2018-10-14T06:52:53Z
main entity:
{"identifier":"Q1059648","url":"https://www.wikidata.org/entity/Q1059648"}
image:
fields total:
13
integrity:
14