от Уикипедия, свободната енциклопедия
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.
Author: Mormegil, created in MS Visio
 |
This image has been (or is hereby) released into the public domain by its author, Mormegil at the Wikipedia-en project. This applies worldwide.
In case this is not legally possible:
Mormegil grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
|
Препратки към файла
Следните страници сочат към файла: