The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
70 views
Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) = (ww . . .(\text{for k times}))^R.$
asked in Set Theory & Algebra by Veteran (56.2k points) | 70 views
0

For length 1 string w = a

 

(aR)(aR)...(for k times)=(aa...(for k times))R

For length 2 string w = ab

(abR)(abR)...(for k times)=(abab...(for k times))R

babababababab..ba = babababababa..ba

so for string for length k  

(wR)(wR)...(for k times)=(ww...(for k times))R

 

 

 

0
@debashish..can you pls give any good links to see such proofs for discrete maths questions?

Please log in or register to answer this question.



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

34,851 questions
41,836 answers
119,102 comments
41,455 users