What is the correct FSA representation of the following string sequence?
I think none of your finite automata accepts the third string ABDDEFGHI.The following is what I think a correct finite automaton for accepting all three strings



In case where your language has the third string ABDDDFGHI.The first is wrong since it accepts another string.The third also seems incorrect since there are multiple labels of same letter exiting from one node.Your second automaton is correct but you may want something like this