Jump to content

File:Pumping-Lemma.png

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Pumping-Lemma.png (794 × 194 pixels, file size: 7 KB, MIME type: image/png)

Summary

Description
Deutsch: Schemazeichnung zur Verdeutlichung des Pumping-Lemmas, eines Satzes der theoretischen Informatik.
English: Demonstration of the pumping lemma for regular languages: Whenever a finite automaton A with n states recognizes a word uvw (shown: starting from an initial state q1, A reaches an accepting state qm on input uvw) of more than n characters, A must reach some state twice (shown: qs = qt). Hence when the middle part v is repeated ("pumped") arbitrarily often (e.g. uvvw, uvvvw, ...), the word is still recognized.
Date

8 April 20066

8 April 2006 (original upload date)
Source Own work (Original text: Selbst erstellt.)
Author Θ~
File:Pumping-Lemma.svg is a vector version of this file. It should be used in place of this PNG file when not inferior.

File:Pumping-Lemma.png → File:Pumping-Lemma.svg

For more information, see Help:SVG.

In other languages
Alemannisch  Bahasa Indonesia  Bahasa Melayu  British English  català  čeština  dansk  Deutsch  eesti  English  español  Esperanto  euskara  français  Frysk  galego  hrvatski  Ido  italiano  lietuvių  magyar  Nederlands  norsk bokmål  norsk nynorsk  occitan  Plattdüütsch  polski  português  português do Brasil  română  Scots  sicilianu  slovenčina  slovenščina  suomi  svenska  Tiếng Việt  Türkçe  vèneto  Ελληνικά  беларуская (тарашкевіца)  български  македонски  нохчийн  русский  српски / srpski  татарча/tatarça  українська  ქართული  հայերեն  বাংলা  தமிழ்  മലയാളം  ไทย  한국어  日本語  简体中文  繁體中文  עברית  العربية  فارسی  +/−
New SVG image

Licensing

Thetawave at the German-language Wikipedia, the copyright holder of this work, hereby publishes it under the following license:
GNU head Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.
Attribution: Thetawave
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
This licensing tag was added to this file as part of the GFDL licensing update.

Original upload log

Transferred from de.wikipedia to Commons by Ireas using CommonsHelper.

The original description page was here. All following user names refer to de.wikipedia.
  • 2006-04-08 11:00 Thetawave 794×194× (7519 bytes) Korrektur: Endzustand markiert.
  • 2006-04-08 10:55 Thetawave 790×194× (6099 bytes) * Bildbeschreibung: Schemazeichnung zur Verdeutlichung des Pumping-Lemmas, eines Satzes der theoretischen Informatik. * Quelle: Selbst erstellt. * Zeichner: ~~~ * Datum: 8. April 2006

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current01:26, 31 August 2010Thumbnail for version as of 01:26, 31 August 2010794 × 194 (7 KB)File Upload Bot (Magnus Manske) {{BotMoveToCommons|de.wikipedia|year={{subst:CURRENTYEAR}}|month={{subst:CURRENTMONTHNAME}}|day={{subst:CURRENTDAY}}}} {{Information |Description={{de|Schemazeichnung zur Verdeutlichung des Pumping-Lemmas, eines Satzes der theoretischen Informatik.}} |So
No pages on the English Wikipedia use this file (pages on other projects are not listed).