in Theory of Computation edited by
3,687 views
0 votes
0 votes

Suppose $h$ is the homomorphism from the alphabet $\{0,1,2\}$ to the alphabet $\{a,b\}$ de fined by$:$ $h(0)=a;h(1)=ab,$ and $h(2)=ba.$

  1. What is $h(0120)?$
  2. What is $h(21120)?$
  3. If $L$ is the language $L(01^{*}2),$ what is $h(L)?$
  4. If $L$ is the language $L(0+12),$ what is $h(L)?$
  5. Suppose $L$ is the language $\{ababa\}$ that is the language consisting of only the one string $ababa.$ What is $h^{-1}(L)?$
  6. If $L$ is the language $L(a(ba)^{*}),$what is $h^{-1}(L)?$
in Theory of Computation edited by
by
3.7k views

Please log in or register to answer this question.

Related questions