@Anand: 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. This recurrence should look familiar. Dave On Feb 6, 8:08 pm, Anand <anandut2...@gmail.com> wrote: > 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. > > I think it is n+1. > > if the len = 3 > abc > bca > > if the len is 6 > aaaabc > aaabca > aabcaa > abcaaa > baaaaa -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
