Turing Machine for Language a^n b^n c^n

An exploration of Turing machines designed to recognize the language consisting of strings with equal numbers of 'a's, 'b's, and 'c's, represented as a^n b^n c^n.