File:An automat accepting the language a(bc)*d.svg

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

Original file ‎(SVG file, nominally 170 × 100 pixels, file size: 8 KB)

Captions

Captions

Add a one-line explanation of what this file represents
Description

The image shows a finite state automaton (FSA).

The FSA accepts the string: abcd. Since this string has a length which is at least as large as the number of states, which is four, the pigeonhole principle indicates that there must be at least one repeated state among the start state and the next four visited states. In this example, only q1 is a repeated state. Since the substring bc takes the machine through transitions that start at state q1 and end at state q1, that portion could be repeated and the FSA would still accept, giving the string abcbcd. Alternatively, the bc portion could be removed and the FSA would still accept giving the string ad. In terms of the pumping lemma, the string abcd is broken into an x portion a, a y portion bc and a z portion d.
Date (UTC)
Source
Author


This is a retouched picture, which means that it has been digitally altered from its original version. Modifications: Vectorized. The original can be viewed here: An automat accepting the language a(bc)*d.png: . Modifications made by Jkwchui.

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

Original upload log[edit]

This image is a derivative work of the following images:

Uploaded with derivativeFX

File history

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

Date/TimeThumbnailDimensionsUserComment
current18:22, 30 January 2011Thumbnail for version as of 18:22, 30 January 2011170 × 100 (8 KB)Jkwchui (talk | contribs){{Information |Description=The image shows a finite state automaton (FSA). The FSA accepts the string: '''abcd'''. Since this string has a length which is at least as large as the number of states, which is four, the pigeonhole principle indicates

You cannot overwrite this file.

File usage on other wikis

Metadata

This file contains additional information such as Exif metadata which may have been added by the digital camera, scanner, or software program used to create or digitize it. If the file has been modified from its original state, some details such as the timestamp may not fully reflect those of the original file. The timestamp is only as accurate as the clock in the camera, and it may be completely wrong.

Retrieved from "https://commons.wikimedia.org/w/index.php?title=File:An_automat_accepting_the_language_a(bc)*d.svg&oldid=791378703"