For len = 6, isn't bcbcbc also valid? On Sun, Feb 6, 2011 at 9:08 PM, Anand <[email protected]> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
