See this:
A Turing machine has an infinite tape that consists of adjacent cells
(or squares). On each cell is written a symbol. The symbols that are
allowed on the tape are finite in number and include the blank symbol.
Each Turing machine has it's own alphabet (i.e., finite set of symbols),
which determines the symbols that are allowed on the tape.