Is there a difference between the equivalent automaton of a grammar and an automaton which accepts the language produced by the grammar?
The answer is really up to the definition of equivalent. The common definition is that two automata/grammars are equivalent if they define the same language. If your class uses the common definition, then both statements are entirely equivalent.