While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, size increase involved in turning back to LTL not. In particular, there no known elementary bound deterministic $\omega$-regular LTL. Our first contribution consists tight bounds for over a unary alphabet: alternating, nondeterministic and can be exactly exponentially, quad...

This paper gives a tableau-based technique for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of given formula. Finite LTL differs from traditional that interpreted with respect to finite, rather than infinite, sequences states; this fact means automata, ω -automata such as those developed by Büchi an...