Problem 1: Let Wn be the number of strings of length n formed from letters A, B, C, and D that do notncontain a substring AA, BA or CA. For example, for n = 2, all the strings with this property areAB, AC, AD, BB, BC, BD, CB, CC, CD, DA, DB, DC, DDand thus W2 = 13. (Note that W0 = 1, because the empty string satisfies the condition.)
(a) Derive a recurrence relation for the numbers Wn. Justify it.
(b) Find the formula for the numbers Wn by solving this recurrence. Show your work.
a) Consider how to get strings with n+1 characters from strings with n characters.
For any of Wn strings with n characters, we can add B,C, D to it to get strings with n+1 characters thus
This question was answered on: Oct 15, 2019Buy this answer for only: $15
This attachment is locked
Pay using PayPal (No PayPal account Required) or your credit card . All your purchases are securely protected by .
About this QuestionSTATUS
Oct 15, 2019EXPERT
YES, THIS IS LEGAL
We have top-notch tutors who can do your essay/homework for you at a reasonable cost and then you can simply use that essay as a template to build your own arguments.
You can also use these solutions:
- As a reference for in-depth understanding of the subject.
- As a source of ideas / reasoning for your own research (if properly referenced)
- For editing and paraphrasing (check your institution's definition of plagiarism and recommended paraphrase).
NEW ASSIGNMENT HELP?
Order New Solution. Quick Turnaround
Click on the button below in order to Order for a New, Original and High-Quality Essay Solutions. New orders are original solutions and precise to your writing instruction requirements. Place a New Order using the button below.
WE GUARANTEE, THAT YOUR PAPER WILL BE WRITTEN FROM SCRATCH AND WITHIN A DEADLINE.