File:DFA example multiplies of 3.svg
Size of this PNG preview of this SVG file: 358 × 158 pixels. Other resolutions: 320 × 141 pixels | 640 × 282 pixels | 1,024 × 452 pixels | 1,280 × 565 pixels | 2,560 × 1,130 pixels.
Original file (SVG file, nominally 358 × 158 pixels, file size: 7 KB)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: Example of a DFA that accepts binary numbers that are multiples of 3.
Čeština: Příklad deterministického konečného automatu, který přijímá binární čísla, která jsou beze zbytku dělitelná třemi. |
| Date | |
| Source | Own work |
| Author | Self-made |
| Other versions | Original PNG |
| Transition monoid | |||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Numeric entries denote functions mapping a state to a state; e.g. 102 abbreviates the function mapping state 0, 1, and 2 to state 1, 0, and 2, respectively; this is the function for digesting an input "1". The table shows the result of function composition, e.g. 021 ∘ 102 = 201, and 102 ∘ 021 = 120. Grey entries give a shortest input string corresponding to a function. |
| Equivalent alternate representations | |||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Regular expression:
| |||||||||||||||||||||||||
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 08:38, 4 November 2020 | 358 × 158 (7 KB) | Jochen Burghardt | colorize state circles | |
| 18:31, 12 February 2018 | 358 × 158 (8 KB) | Leyth | Reshaped the graph again. | ||
| 18:27, 12 February 2018 | 654 × 194 (8 KB) | Leyth | Enhancing the graph with an automata generation helper. | ||
| 16:33, 16 May 2008 | 1,230 × 523 (21 KB) | Mormegil | bottom arrows fixed | ||
| 03:08, 20 March 2007 | 1,230 × 523 (19 KB) | Mikm | Fixed two of the arrows | ||
| 03:05, 20 March 2007 | 1,230 × 523 (19 KB) | Mikm | {{Information |Description= (en) Example of a DFA that accepts binary numbers that are multiplies of 3. (cs) Ukázka deterministického konečného automatu, který přijímá binární čísla, která jsou beze zbytku dělitelná třemi. |Source= Self-m |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
Global file usage
The following other wikis use this file:
- Usage on ar.wikipedia.org
- أتمتة محدودة قطعية
- مستخدم:Nojoud 95/ملعب
- تجربة بناء طومسون
- Usage on bg.wikipedia.org
- Краен автомат
- Usage on cs.wikipedia.org
- Konečný automat
- Wikipedie:Pod lípou/Archiv 2011/06
- Usage on eo.wikipedia.org
- Finia aŭtomato
- Usage on fa.wikipedia.org
- پذیرنده متناهی معین
- الگوریتم ساختمان تامپسون
- Usage on ko.wikipedia.org
- 결정론적 유한 상태 기계
- Usage on pl.wikipedia.org
- Automat skończony
- Portal:Linux
- Portal:Linux/Portale
- Usage on pt.wikipedia.org
- Autômato finito determinístico
- Algoritmo de Thompson
- Usage on ro.wikipedia.org
- Algoritmul lui Thompson
- Usage on ru.wikipedia.org
- Детерминированный конечный автомат
- Usage on tr.wikipedia.org
- Deterministik sonlu durum makinesi
- Usage on uk.wikipedia.org
- Детермінований скінченний автомат
- Usage on zh-yue.wikipedia.org
- 有限狀態機