10. For any string w = W₁W₂ ... Wn, with each w, in {0, 1}, the opposite string Wop = X1X2 ... Xn, where X₁ # w₁ for i i

[answerhappygod]

10 For Any String W W W Wn With Each W In 0 1 The Opposite String Wop X1x2 Xn Where X W For I I 1 (18.85 KiB) Viewed 46 times

10. For any string w = W₁W₂ ... Wn, with each w, in {0, 1}, the opposite string Wop = X1X2 ... Xn, where X₁ # w₁ for i in {1, 2, n}. That is, if w₁ = 0, then x₁ = 1. And if w₁ = 1, then x₁ = 0. Let L be a language, and define Lop = { Wop | w in L}. Prove or disprove that if L is regular, then so is Lop-