3 votes 3 votes Theory of Computation regular-expression regular-language theory-of-computation + – monali asked Nov 24, 2015 • retagged Jun 4, 2017 by Arjun monali 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 4 votes 4 votes abw = wab one of solution is, w = (ab)* [w can be any string ∈ (ab)* ] So length of W must be even for sure.(But all even length string ∈{a,b}* may not satisfy abW = Wab) Digvijay Pandey answered Nov 24, 2015 • selected Nov 25, 2015 by Praveen Saini Digvijay Pandey comment Share Follow See all 2 Comments See all 2 2 Comments reply monali commented Nov 24, 2015 reply Follow Share if only some of strings can satisfy then how we can say that it is even length? 0 votes 0 votes Digvijay Pandey commented Nov 24, 2015 reply Follow Share Relate following : S = {2,5} Cardinality of set S is 2. Cardinality of set S is Even. Both statement are true. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes |w| must be even navya n answered Sep 21, 2017 navya n comment Share Follow See all 0 reply Please log in or register to add a comment.