Proof that whether a regular language is finite is decidable
If $L$ is infinite, it contains strings of unbounded length.  Think about the sequence of states visited by the automaton when these strings are accepted. This will give you a condition of the form "$M$&nbsp;accepts an infinite language implies&nbsp;$X$".  Now check that it's actually "if and only if&nbsp;$X$."