1.

While proving Inverse Homomorphism, which of the following steps are needed?(a) Start with a DFA Ain L(b) Construct a DFA B for h-1(L)(c) The set of states, initial and final states should be same.(d) All of the mentionedThis question was posed to me during an online exam.The question is from Reversal-Homomorphism and Inverse Homomorphism topic in section Properties of Regular Languages of Automata Theory

Answer»

The correct choice is (d) All of the mentioned

Explanation: While constructing DFA B, we NEED to take care of the following:

a) The same SET of states

b) The same START state

c) The same final state

d) INPUT alphabet = the symbols to which HOMOMORPHISM h applies.



Discussion

No Comment Found

Related InterviewSolutions