Prove that the following language is decidable: Input: The description of a DFA A.
YES if A accepts the empty string.
NO if A does not accept the empty string.
I am struggling with how to prove this, or even what would count as proving this question.
My thinking for part A is currently,for a given Turing Machine the language will always halt because the input will either accept or reject the empty string by definition of DFA. So... DFA A will either accept the empty string or reject the empty string, but regardless the Turing Machine that represents the language will halt. Do I even need to be discussing turing machines in part a?
Honestly not sure if my thinking is at all on the right path...