Prove that a finite language is a regular language.
How would I go about solving this? I tried my own approach (below) but didn't get far because I don't understand how I am supposed to approach this proof.
Consider a finite automata M
($\delta$* denotes $\delta$ hat(^) which means all states w travels to until empty)
if w is a string and w $\in$L* (any finite language)
=> $\delta$*($q_0$, w)$\in$F (then i make a logic statement that says for all w this is true?)
and if w$ \in$$\epsilon$
=> $\delta$*($q_0$, $\epsilon$ )$\in$F