1 votes 1 votes Please explain:- Theory of Computation theory-of-computation regular-expression finite-automata + – learner_geek asked Aug 15, 2017 learner_geek 386 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes 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 just_bhavana answered Aug 15, 2017 selected Aug 15, 2017 by learner_geek just_bhavana comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes It is option D md ruksar tabassum answered Nov 11, 2017 md ruksar tabassum comment Share Follow See all 0 reply Please log in or register to add a comment.