A hypergraph \(H\) is said to be \(r\)-partite \(r\)-uniform if its vertex set \(V\) can be partitioned into non-empty sets \(V_1, V_2, \cdots, V_r\) so that every edge in the edge set \(E(H)\), consists of precisely one vertex from each set \(V_i\), \(i=1,2,\cdots,r\). It is denoted as \(H^r(V_1,V_2,\cdots,V_r)\) or \(H^r_{(n_1,n_2,\cdots,n_r)}\) if \(|V_i|=n_i\) for \(i=1,2,\cdots,r\). There exists an \(r\)-partite self-complementary \(r\)-uniform hypergraph \(H^r(V_1,V_2,\cdots,V_r)\) where \(|V_i|=n_i\) for \(i=1,2,\cdots,r\) if and only if at least one of \(n_1,n_2,\cdots,n_r\) is even. And there exists an \(r\)-partite almost self-complementary \(r\)-uniform hypergraph \(H^r(V_1, V_2,\cdots,V_r)\) where \(|V_i|=n_i\) for \(i=1,2,\cdots,r\) if and only if \(n_1,n_2,\cdots,n_r\) are odd. In this paper, we prove the existence of regular \(3\)-partite self-complementary \(3\)-uniform hypergraphs. Further we prove there does not exist a regular \(3\)-partite almost self-complementary \(3\)-uniform hypergraph.