Final answer:
Deterministic Finite Automaton (DFA) for a language requiring third symbol from the right end to be 0 would consist of at least four states, with transitions based on reading symbols 0 or 1 and leading to an accepting state where the third symbol from the end is 0. The specific DFA cannot be identified without diagrams.
Step-by-step explanation:
To design a Deterministic Finite Automaton (DFA) for the language over the alphabet {0,1} where the third symbol from the right end is a 0, we focus on the last three digits of strings as our pattern. As such, we need states to track the last three symbols that have been read. We start in an initial state where we have not yet read any symbols. Once we read our first symbol (either 0 or 1), we transition to a state indicating that one symbol has been read. We continue this process until we reach a state indicating that the symbol third from the end is a 0. We designate this as our 'accepting state.'
The correct DFA will have at least four states: an initial state (q0), two intermediate states (q1 and q2 for reading the first and second symbols), and one accepting state (q3) where the third symbol is confirmed to be 0. The transitions will be based on reading 0 or 1, and once in the accepting state, any number of symbols (0 or 1) can be read as they will not affect the condition of the third symbol from the right being a 0.
Without the diagrams for DFA1, DFA2, DFA3, and DFA4, the specific answer cannot be determined. However, an example of a general structure for such a DFA could be described as stated above, where states and transitions are defined according to the condition that the third symbol from the right end must be a 0.