Prove Every Finite Language Regular Concretely Given Finite Language L Design Dfa Recogniz Q37169271

Prove that every finite language is regular. Concretely, given afinite language L, design a DFA that recognizes it.

（PS：should NOT go through NFA’s or Regular expressions. ）

Answer