1.

Which of the following obey the closure properties of Regular language?(a) Homomorphism(b) Inverse Homomorphism(c) Reversal(d) All of the mentionedI have been asked this question by my school teacher while I was bunking the class.The question is from Reversal-Homomorphism and Inverse Homomorphism in chapter Properties of Regular Languages of Automata Theory

Answer»

Correct option is (d) All of the mentioned

For explanation: Homomorphism on an aphabet is a FUNCTION that gives a STRING for each SYMBOL in that alphabet. Example: h(0)=ab, ETC.



Discussion

No Comment Found

Related InterviewSolutions