2 2 votes if A is regular, L= HALF(A)= { x | for some y, |x|= |y| and xy ϵ A} is regular i want to ask if i know DFA for A, how to construct DFA for L ?? Theory of Computation theory-of-computation + – joshi_nitish 760 views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Hemant Parihar commented Aug 1, 2017 reply Follow flag https://gateoverflow.in/93981/half-l 0 0 replyShare joshi_nitish commented Aug 1, 2017 reply Follow flag the explanation given there is just initutative, i have also solved it on intution based, if i give you regular expression for 'A' ,can you write regular expression for L ?? 0 0 replyShare Bikram commented Aug 8, 2017 reply Follow flag @ joshi_nitish Read this : http://www-bcf.usc.edu/~breichar/teaching/2011cs360/half(L)example.pdf 1 1 replyShare Please log in or register to add a comment.
