(A) Mealy and Moore machine are language acceptors. TRUE
because Mealy and Moore both are finite state machines.So. both of them are accepting some language.
(B) Finite State automata is language translator. FALSE
Finite State automata cannot translate a language into another.
(C) NPDA is more powerful than DPDA. TRUE
D) Mealy machine is more powerful than Moore machine. FALSE
So, the answer will be both A) & C)