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
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
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
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-
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!