Question

a "language" consists of thrree words, w１＝a, w2=ba, w3=bb. let N(k) be number of "sentencces" using exactly k letters ex N(1)=1 (i.e a),N(2)=3 (aa,ba,bb), N(3) =5(aaa,aba,abb,baa,bba) no space is allowed between words.

a. show that N(k) = N(k-1) + 2N(k-2) ,k =2,3,... define (N(0)=1)

how to proof this?

Answer 1

Ce (k) lottu scuteu a uhichcan be dene in would hote give w k letus seuRu co No wo main NO a れ latars c2