Question

Morse code messages are composed of two types of signals, a dot and a dash. Suppose that it takes 1 time unit to transmit a dot and 2 time units to transmit a dash.

Problem: Compute the total number Sn of different Morse code messages (message=any string of dots and dashes) that can be sent in n time units? To solve this problem, complete the following steps:

1.Show that S1=1, S2=2, S3=3, S4=5 by just listing all of the possible messages in each case.

2.Explain why the following recurrence relation holds for Sn:

Sn = Sn-1 + Sn-2 for n > 2

Answer 1

HELP!!!

Answer 2

\[\S_{n} = \S_{n-1} + \S_(\]

Answer 3

\[s _{n}=s_{n-1} + s_{n-2}\]

Answer 4

S1- dot
S2- dot dot, dash
S3- dot dot dot, dash dot, dot dash
S4- dash dash, dot dot dot dot, dash dot dot, dot dash dot, dot dot dash

Answer 5

then what

Answer 6

this is first part, I am trying to figure out the second

Answer 7

ok

Answer 8

s1- e
s2- i,t
s3- s,n,a
s4- m,h,d,r,u

Answer 9

?