File:Pumping lemma for regular languages.PNG

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Pumping_lemma_for_regular_languages.PNG(329 × 124 pixels, file size: 4 KB, MIME type: image/png)

Captions

Captions

Add a one-line explanation of what this file represents
This math image could be re-created using vector graphics as an SVG file. This has several advantages; see Commons:Media for cleanup for more information. If an SVG form of this image is available, please upload it and afterwards replace this template with {{vector version available|new image name}}.


It is recommended to name the SVG file “Pumping lemma for regular languages.svg”—then the template Vector version available (or Vva) does not need the new image name parameter.

Summary

[edit]

This automaton is used to illustrate the proof of the pumping lemma for regular languages.

I created this image myself using the free program JFLAP and MS-Paint.

Licensing

[edit]
I, the copyright holder of this work, hereby publish it under the following licenses:
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.
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.
You may select the license of your choice.

File history

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

Date/TimeThumbnailDimensionsUserComment
current17:23, 6 October 2006Thumbnail for version as of 17:23, 6 October 2006329 × 124 (4 KB)Yuval Madar (talk | contribs)== Summary == This automaton is used to illustrate the proof of the pumping lemma for regular languages. I created this image myself using the free program [http://www.jflap.org/ JFLAP]. == Licensing == {{GFDL-self}} Category:Automata [[Category:Yu

There are no pages that use this file.

File usage on other wikis