Abstract: In this paper we define and classify the logical computational types of the Pushdoun Automata (one-way),and we prove that each of them is linear time bounded.