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.
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.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
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.http://creativecommons.org/licenses/by-sa/3.0/CC BY-SA 3.0Creative Commons Attribution-Share Alike 3.0truetrue
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
{{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
File usage
No pages on the English Wikipedia use this file (pages on other projects are not listed).