This is a file from the Wikimedia Commons

File:Deterministicfiniteautomaton.svg

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

Original file ‎(SVG file, nominally 310 × 300 pixels, file size: 14 KB)

Summary

Description
English: DFA example. It accepts the same language as the regular expression a*b(b|a(a|b))*, see Kleene's algorithm.
Ελληνικά: Παράδειγμα ντετερμινιστικού πεπερασμένου αυτόματου
Date
Source Own work, created with Inkscape
Author Vevek
Transition monoid
  ε
012		 a
021		 b
111		 ab
222
ε
012 		ε
012		 a
021		 b
111		 ab
222
a
021 		a
021		 ε
012		 ab
222		 b
111
b
111 		b
111		 b
111		 b
111		 b
111
ab
222 		ab
222		 ab
222		 ab
222		 ab
222

Numeric entries denote functions mapping a state to a state; e.g. 021 abbreviates the function mapping state 0, 1, and 2 to state 0, 2, and 1, respectively; this is the function for digesting an input "a". The table shows the result of function composition, e.g. 021 ∘ 111 = 222, and 111 ∘ 021 = 111. Grey entries give a shortest input string corresponding to a function.

Licensing

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 alter, transform, or build upon this work, you may distribute the resulting work only under the same or similar license to this one.

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.

File history

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

Date/TimeThumbnailDimensionsUserComment
current19:54, 18 April 2009Thumbnail for version as of 19:54, 18 April 2009310 × 300 (14 KB)VevekArrow corected.
19:45, 18 April 2009Thumbnail for version as of 19:45, 18 April 2009310 × 300 (13 KB)VevekReverted to version as of 19:38, 18 April 2009
19:44, 18 April 2009Thumbnail for version as of 19:44, 18 April 2009310 × 300 (14 KB)VevekAn arrow added, stating the start state.
19:38, 18 April 2009Thumbnail for version as of 19:38, 18 April 2009310 × 300 (13 KB)VevekEven larger image. This is the wanted size.
19:33, 18 April 2009Thumbnail for version as of 19:33, 18 April 2009140 × 130 (13 KB)VevekLarger image
19:22, 18 April 2009Thumbnail for version as of 19:22, 18 April 200964 × 64 (13 KB)Vevek{{Information |Description={{en|1=DFA example}} {{el|1=Παράδειγμα ενός ντετερμινιστικού πεπερασμένου αυτόματου}} |Source=Own work, created with Inkscape |Author=Vevek |Date=2009-04-18 |Perm
The following pages on the English Wikipedia link to this file (pages on other projects are not listed):

Global file usage

Retrieved from "https://en.wikipedia.org/wiki/File:Deterministicfiniteautomaton.svg"