in Theory of Computation
458 views
2 votes
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 ??
in Theory of Computation
458 views

3 Comments

0
0
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
1
1

Please log in or register to answer this question.

Related questions