Morphism of automata category

Morphism of automata category

What is the typed morphism in category $\mathcal{A}$ of finite automata?
Let $\mathcal{G}$ be a category of oriented graphs. Does $\mathcal{A}$
equivalent to $\mathcal{C}$