Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | A string matching algorithm which builds a deterministic finite state machine to recognize the search string. The machine is then run at each location in turn. If the machine accepts, that is a match. (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 41 55 54 4F 4D 41 54 41 53 54 52 49 4E 47 53 45 41 52 43 48 |
| 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 01000001 01010101 01010100 01001111 01001101 01000001 01010100 01000001 00100000 01010011 01010100 01010010 01001001 01001110 01000111 00100000 01010011 01000101 01000001 01010010 01000011 01001000 |
HTML Code (1990) (references)D E T E R M I N I S T I C   F I N I T E   A U T O M A T A   S T R I N G   S E A R C H |
ISO 10646 (1991-1993) (references)0044 0045 0054 0045 0052 004D 0049 004E 0049 0053 0054 0049 0043 0046 0049 004E 0049 0054 0045 0041 0055 0054 004F 004D 0041 0054 0041 0053 0054 0052 0049 004E 0047 0053 0045 0041 0052 0043 0048 |
Encryption (beginner's substitution cypher): (references)3839543952474348435354433724043484354392355554494735543525354524348412533935523742 |
| 1. Orthography 2. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
