Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Pumping_lemma> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Pumping_lemma abstract "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 regularPumping 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 languages are not context-free Pumping lemma for indexed languages Pumping lemma for regular tree languages".
- Pumping_lemma wikiPageID "24449".
- Pumping_lemma wikiPageLength "808".
- Pumping_lemma wikiPageOutDegree "6".
- Pumping_lemma wikiPageRevisionID "698848939".
- Pumping_lemma wikiPageWikiLink Formal_language.
- Pumping_lemma wikiPageWikiLink Indexed_language.
- Pumping_lemma wikiPageWikiLink Ogdens_lemma.
- Pumping_lemma wikiPageWikiLink Pumping_lemma_for_context-free_languages.
- Pumping_lemma wikiPageWikiLink Pumping_lemma_for_regular_languages.
- Pumping_lemma wikiPageWikiLink Tree_automaton.
- Pumping_lemma wikiPageWikiLinkText "Pumping lemma".
- Pumping_lemma wikiPageWikiLinkText "pumping lemma".
- Pumping_lemma wikiPageUsesTemplate Template:Sia.
- Pumping_lemma type Language.
- Pumping_lemma type Combinatoric.
- Pumping_lemma type Language.
- Pumping_lemma type Lemma.
- Pumping_lemma type Redirect.
- Pumping_lemma type Theorem.
- Pumping_lemma comment "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 regularPumping 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 languages are not context-free Pumping lemma for indexed languages Pumping lemma for regular tree languages".
- Pumping_lemma label "Pumping lemma".
- Pumping_lemma sameAs Q1059648.
- Pumping_lemma sameAs Osobina_napuhavanja.
- Pumping_lemma sameAs Lemma_o_vkládání.
- Pumping_lemma sameAs Pumping-Lemma.
- Pumping_lemma sameAs Lema_del_bombeo.
- Pumping_lemma sameAs لم_پمپاژ.
- Pumping_lemma sameAs Pumppauslemma.
- Pumping_lemma sameAs Lemme_de_lxc3xa9toile.
- Pumping_lemma sameAs Svojstvo_napuhavanja.
- Pumping_lemma sameAs Pumping_lemma.
- Pumping_lemma sameAs 反復補題.
- Pumping_lemma sameAs 펌핑_보조정리.
- Pumping_lemma sameAs Pompstelling.
- Pumping_lemma sameAs Lema_do_bombeamento.
- Pumping_lemma sameAs Lema_de_pompare.
- Pumping_lemma sameAs Лемма_о_разрастании.
- Pumping_lemma sameAs Пампинг_лема.
- Pumping_lemma sameAs Лема_про_накачку.
- Pumping_lemma sameAs Q1059648.
- Pumping_lemma sameAs 泵引理.
- Pumping_lemma wasDerivedFrom Pumping_lemma?oldid=698848939.
- Pumping_lemma isPrimaryTopicOf Pumping_lemma.