What is meant by TM encoding in Theory of Automata and Formal Languages?

A. storing a DFA inside a stack only B. turning a language into a hardware chip C. representing a Turing machine as a string over an alphabet D. removing all input symbols