This paper investigates the language class defined by Propositional Projection Temporal Logic with star (PPTL with star). To this end, B
chi automata are first extended with stutter rule (SBA) to accept finite words. Correspondingly,
-regular expressions are also extended (ERE) to express finite words. Consequently, by three transformation procedures between PPTL with star, SBA and ERE, PPTL with star is proved to represent exactly the full regular language.