This talk will be about reasoning and planning for goals expressed over nite traces, instead of states. We will look at goals speci ed in two speci c logics (i) LTLf , i.e., LTL interpreted over nite traces, which has the expressive power of FOL and star-free regular expressions over nite stings; and (ii) LDLf , i.e., Linear-time Dynamic Logic on nite traces, which has the expressive power of MSO and full regular expressions. We will review the main results and algorithmic techniques to handle reasoning, planning in deterministic domains, and especially planning in nondeterministic domains. We will also brie y consider stochastic domains. Moreover, we will draw connections with veri cation and reactive synthesis. The main catch is that working with these logics can be based on manipulation of regular automata on nite strings, for which well-established algorithms are available.