974

/in /by

5. An alphabet is a non-empty finite set of symbols, and a string over the alphabet is a finite sequence of symbols of the alphabet. Some example strings over the binary alphabet {0,1} are: 1011 (for the sequence (1,0,1,1), 10 (for the sequence (1,0)), e (denoting the empty sequence).

Attachments:

1.png