The hardest linear conjunctive language was discussed. The P-complete language of yes-instances of Circuit Value Problem under a suitable encoding was generated by a linear conjunctive grammar, and it was accepted by a triangular trellis automaton. The results have implications on properties of languages generated by conjunctive grammars of general form and on the relationship between the abstract models of parallel computation.