Minimal transducer that maps one word into another

Let A,B be the words over the different alphabets and |A|=|B| (words A
and B have equal lengths). How to create a transducer with minimal
number of states, that maps the input word A into the output word B?

I think that this problem is NP hard, but I am not sure?

.