Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A finite state machine with exactly one transition for each given symbol and state. (references) |
Source: compiled by the editor from various references; see credits. | |
Crosswords: DETERMINISTIC FINITE STATE MACHINE |
| Specialty definitions using "DETERMINISTIC FINITE STATE MACHINE": deterministic finite automata string search, deterministic finite tree automaton, deterministic tree automaton. (references) |
Hexadecimal (or equivalents, 770AD-1900s) (references)44 45 54 45 52 4D 49 4E 49 53 54 49 43 46 49 4E 49 54 45 53 54 41 54 45 4D 41 43 48 49 4E 45 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000100 01000101 01010100 01000101 01010010 01001101 01001001 01001110 01001001 01010011 01010100 01001001 01000011 00100000 01000110 01001001 01001110 01001001 01010100 01000101 00100000 01010011 01010100 01000001 01010100 01000101 00100000 01001101 01000001 01000011 01001000 01001001 01001110 01000101 |
HTML Code (1990) (references)D E T E R M I N I S T I C   F I N I T E   S T A T E   M A C H I N E |
ISO 10646 (1991-1993) (references)0044 0045 0054 0045 0052 004D 0049 004E 0049 0053 0054 0049 0043 0046 0049 004E 0049 0054 0045 0053 0054 0041 0054 0045 004D 0041 0043 0048 0049 004E 0045 |
Encryption (beginner's substitution cypher): (references)38395439524743484353544337240434843543925354355439247353742434839 |
| 1. Crosswords 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
