Let R=Z₄ be the integer ring mod 4 and C be a linear code over R. The code C is called a triple cyclic code of length (r, s, t) over R if the set of its coordinates can be partitioned into three parts so that any cyclic shift of the coordinates of the three parts leaves the code invariant. These codes can be viewed as R[x]-submodules of R[x]/<x^r-1>×R[x]/<x^s-1>×R[x]/<x^t-1>. In this paper, we determine the generator polynomials and the minimum generating sets of this kind of codes.