There is a language with only two elements ie 'a' and 'bc'. How many words can be
made out of it if whose Length is n.
Let N(k) be the number of strings of length k. Since you can
make a string of length k by appending 'a' onto a string of length k-1
or by appending 'bc' onto a string of length k-2, it follows that
N(k) = N(k-1) + N(k-2)
Furthermore, there are no strings of length -1 and only one string of
length 0.
made out of it if whose Length is n.
Let N(k) be the number of strings of length k. Since you can
make a string of length k by appending 'a' onto a string of length k-1
or by appending 'bc' onto a string of length k-2, it follows that
N(k) = N(k-1) + N(k-2)
Furthermore, there are no strings of length -1 and only one string of
length 0.
No comments:
Post a Comment