A ___________ is a substitution such that h(a) contains a string for each a.
(a) Closure
(b) Interchange
(c) Homomorphism
(d) Inverse Homomorphism
I got this question in an interview.
Question is from Union, Intersection & Complement topic in division Finite Automata of Automata Theory