2 2 votes Consider the homomorphism, h(0) = aba, h(1) = abb Given L = (a + bb)*ba, which of the following represent the h-1(L) 0* 100* 1*0 11*0 Theory of Computation + – A_i_$_h 2.4k views answer comment Share Follow Print See all 9 Comments 9 9 Comments reply Show 6 previous comments Anu007 commented Nov 3, 2017 reply Follow flag Any resource about that. 0 0 replyShare joshi_nitish commented Nov 3, 2017 reply Follow flag inverse homomorphism need not contain mappings for all the strings of L, some strings might be lost during inverse homomorphism case. this is main reason why h(h−1(L)) can be a subset of L is true, otherwise, it would be, h(h−1(L)) = L.. 4 4 replyShare Rupendra Choudhary commented Nov 3, 2017 reply Follow flag You're right nitish actually. in general h (h-1(L)) ⊆ L ⊆ h-1(h(L) ) h-1(L)={w∈ Σ* | h(w)∈ L} option a) h-1(L)=0* it contains string 00 and h(00)=abaaba which doesn't belong to our L option b ) h-1(L)=100* it contains string 100 and h(100)=abbabaaba which doesn't belong to our L option d) h-1(L)=11*0 it's subset of option c , so see if string that doesn't belong to option d is also supported then , answer is option c. 0 is string that belongs to option c but not d and it's supported so answer is option c , albeit i don't know way to directly tell h-1(L) i'm attaching source to understand homomorphism , those problems are quite less important from GATE point of view , so it's better to don't put much research here. https://courses.engr.illinois.edu/cs373/sp2013/Lectures/lec08.pdf 1 1 replyShare Please log in or register to add a comment.