Lattice paths are fundamental combinatorial objects, and their enumeration has strong connections to other fields (physics, computer science). In this talk, we will review enumeration of models of lattice paths with forbidden patterns and with dynamic boundary in both one- and two-dimensional models. We will also examine how automata-based approaches often result in the simplification and classification of enumeration problems.