edited by
323 views
1 votes
1 votes

If $h$ represents the Homomorphic image of a string and $h^{-1}$  represent the Inverse Homomorphic image of a string. We have a language $L$, 

$(A)\  h(h^{-1}(L)) = L$

$(B)\  h(h^{-1}(L)) \subset L$

$(C)\  h(h^{-1}(L)) \subset L$

$(D)\  None$

Some reference given here, but I am not able to understand:  https://courses.engr.illinois.edu/cs373/sp2013/Lectures/lec08.pdf (5th page)

edited by

Please log in or register to answer this question.

Related questions

2 votes
2 votes
0 answers
1
gauravkc asked Jan 29, 2018
1,027 views
Consider the homomorphism h(a) = 11 amd h(b) = 10. Consider the inverse homomorphism of the regular set (01+00)*a) The resulting set is emptyb) The resulting set is 00*c)...
2 votes
2 votes
1 answer
2
aditi19 asked Mar 24, 2019
1,596 views
How many possible finite automata ( DFA ) are there with two states X and Y, where X is always initial state with alphabet a and b, that accepts everything?answer is 20 o...
1 votes
1 votes
2 answers
3
aditi19 asked Mar 24, 2019
632 views
If $L = \Bigl \{ x \mid x \in \{ a, b, c \}^*, \text{The length of $x$ is a square } \Bigr \}$ then $L$ isRegularRecursive but not context freeContext Free but not regula...