File:Deterministicfiniteautomaton.svg
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 |
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:
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.
 |
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.