[其他] (離散)遞迴關係

看板Math作者 (也只是 蜉蝣)時間13年前 (2012/07/22 00:54), 編輯推噓1(100)
留言1則, 1人參與, 最新討論串1/1
不好意思,想不到這題怎麼處理,希望有人可以給點想法或見解。 題目: Find a system of recurrence relations for the number of n-digit binary sequences with k adjacent pairs of 1s and no adjacent pairs of 0s. PS:是指k組相鄰的1和沒有相鄰的0嗎? 答案: a_n,k = a_n,k,0 +a_n,k,1 a_n,k,0 = a_(n-1),k,1 a_n,k,1 = a_(n-1),k,0 + a_(n-1),(k-1),1 where a_n,k,0 = such sequences staring with a 1 a_n,k,1 = such sequences staring with a 0 謝謝! -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 220.134.252.142

07/22 01:04, , 1F
yes
07/22 01:04, 1F
文章代碼(AID): #1G2jx0p_ (Math)