0 votes 0 votes Prove that all finite languages are regular. Theory of Computation peter-linz peter-linz-edition4 theory-of-computation finite-automata regular-language + – Naveen Kumar 3 asked Mar 30, 2019 Naveen Kumar 3 206 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.