809 views

2 Answers

Best answer
1 1 vote

Answer is D)

In homomorphism, we replace each letter by a single string corresponding to that letter.

h(ba*) = 1(01)*

And by property of regular languages, 1(01)* = (10)*1

• selected by
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
1.5k
1.5k views
learner_geek asked Aug 15, 2017
1,504 views
Complement of (0+1)*1 ?? my answer is (0+11*0)*given answer is (1*0)* please give detail explanation!
1 1 vote
0 0 answers
563
563 views
aftab0711 asked Aug 13, 2024
563 views
Select the correct statements (1) L1 = L2 if and only if L1* = L2* (2) For any languages L1, L2 and L3, L1 (L2 ∩ L3) ⊆ (L1L2) ∩ (L1L3)(3) For any languages L1, L2 and L3,...
1 1 vote
2 2 answers
644
644 views
aftab0711 asked Aug 11, 2024
644 views
Which of the following languages is/are regular?
0 0 votes
0 0 answers
572
572 views
admin asked Apr 3, 2019
572 views
Prove that $(L^{*}M^{*})^{*}=(L+M)^{*}.$Complete the proof by showing that strings in $(L^{*}M^{*})^{*}$ are also in $(L+M)^{*}.$