0 votes 0 votes Let L1 = { anb2n | n >= 1}, and h(p) = a , h(q) = aa. If L2 = h-1(L1) . What will be the language? Please explain the operation of homomorphism for understanding. I am unable to follow inverse homomorphism. Theory of Computation theory-of-computation homomorphism + – AnilGoudar asked Sep 18, 2017 AnilGoudar 1.4k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Rupendra Choudhary commented Sep 18, 2017 reply Follow Share Hello Anil are you sure here it's h(q)=aa ? not bb because in that way the answer would be ∅ tell me so that i take it again. 0 votes 0 votes AnilGoudar commented Sep 18, 2017 reply Follow Share @Rupendra Choudhary , Yes, it is h(p) = a, h(q) = aa. How to apply the homomorphism? Can you please explain me in general. 0 votes 0 votes akash.dinkar12 commented Nov 30, 2017 reply Follow Share Inverse homomorphic image of any string in this language does not exist that's why h-1 (L) = { }=phi 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes if h(q)=bb then a^+(bb)^+ otherwise phi Yash4444 answered Oct 26, 2019 Yash4444 comment Share Follow See all 0 reply Please log in or register to add a comment.