retagged by
746 views
1 votes
1 votes

Let r = (10 + 0) * 11(0 + 1) * be a regular expression for the regular language L and let h(0) = ab and h(1) = ba a homomorphism. What is a regular expression for h(L)? How about h −1 (L′) if L′ is given by the regular expression r ′ = (ab + a) * bb(a + b) *?

retagged by

1 Answer

Related questions

3 votes
3 votes
1 answer
1
rahul sharma 5 asked Aug 3, 2017
2,052 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
0 votes
0 votes
1 answer
3
1 votes
1 votes
2 answers
4
Ashish Roy 1 asked Sep 27, 2018
2,126 views
Given two Regular expressions are equal or not ?1) (1+01*0)* 2) 1*(01*0)* 1*Give proper explanation also.