1,424 views
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.

1 Answer

Related questions

2 votes
2 votes
0 answers
1
3 votes
3 votes
1 answer
2
rahul sharma 5 asked Aug 3, 2017
2,054 views
Which is false?A.h($h^{-1}$(L)) can be a subset of LB.$h(h^{-1}(L))$ =LC.$h^{-1}(L)$ can be emptyD.$h^{-1}(h(L))$ can be superset of L
1 votes
1 votes
1 answer
3
dd asked Dec 28, 2016
1,092 views
Explain with examples.$\begin{align*} &A. \;\; h(h^{-1}(L)) \text{ can be a subset of L}\\ &B. \;\; h^{-1}(h(L)) \text{ can be a superset of L} \\ \end{align*}$
6 votes
6 votes
1 answer
4
Chetnawadhwa asked Jul 17, 2016
11,708 views
What exactly Homomorphism of a language is? What is the need of it? .. And how is it closed under regular languages?