Is the langauge of (descriptions of) DFAs that accept $\Sigma^*$ decidable?
It's decidable. Think about what an DFA's accepting states must look like if it accepts every possible string. That property is very easy to check.