File:Deterministicfiniteautomaton.svg
Original file (SVG file, nominally 310 × 300 pixels, file size: 14 KB)
 |
This is a file from the Wikimedia Commons |
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 | |||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
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
- 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.
|
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. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 19:54, 18 April 2009 | | 310 × 300 (14 KB) | Vevek | Arrow corected. |
| 19:45, 18 April 2009 |  | 310 × 300 (13 KB) | Vevek | Reverted to version as of 19:38, 18 April 2009 | |
| 19:44, 18 April 2009 |  | 310 × 300 (14 KB) | Vevek | An arrow added, stating the start state. | |
| 19:38, 18 April 2009 |  | 310 × 300 (13 KB) | Vevek | Even larger image. This is the wanted size. | |
| 19:33, 18 April 2009 |  | 140 × 130 (13 KB) | Vevek | Larger image | |
| 19:22, 18 April 2009 |  | 64 × 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 |
File usage
The following 4 pages use this file:
- A-level Computing/AQA/Paper 1/Theory of computation/Finite state machines
- A-level Computing/AQA/Print version/Unit 1
- A-level Computing 2009/AQA/Print version/Unit 1
- A-level Computing 2009/AQA/Problem Solving, Programming, Data Representation and Practical Exercise/Problem Solving/Finite state machines
Global file usage
The following other wikis use this file:
- Usage on ca.wikipedia.org
- Usage on el.wikipedia.org
- Usage on en.wikipedia.org
- Usage on fa.wikipedia.org
- Usage on pt.wikipedia.org
- Usage on ru.wikipedia.org
- Usage on uk.wikipedia.org
