Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A deterministic finite state machine that accepts finitary trees rather than just strings. The tree nodes are marked with the letters of the alphabet of the automaton, and the transition function encodes the next states for each branch of the tree. The acceptance condition is modified accordingly. (references) |
Source: compiled by the editor from various references; see credits. | |
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 54 52 45 45 41 55 54 4F 4D 41 54 4F 4E |
| 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 01010100 01010010 01000101 01000101 00100000 01000001 01010101 01010100 01001111 01001101 01000001 01010100 01001111 01001110 |
HTML Code (1990) (references)D E T E R M I N I S T I C   F I N I T E   T R E E   A U T O M A T O N |
ISO 10646 (1991-1993) (references)0044 0045 0054 0045 0052 004D 0049 004E 0049 0053 0054 0049 0043 0046 0049 004E 0049 0054 0045 0054 0052 0045 0045 0041 0055 0054 004F 004D 0041 0054 004F 004E |
Encryption (beginner's substitution cypher): (references)3839543952474348435354433724043484354392545239392355554494735544948 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
