Question
can someone help me with this two questions please
thank you
4. Find a recurrence relation (with initial conditions) for an, the number of ternary sequences of length n that do not conta
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Page Nol = | The number of ternary sequences of length. that do not contain three consective digits Seh Each term of I with tPage Noz Also is in all in all sequences in a we replace oby a aby, and I by o; All these sequence will convert torsequences

Add a comment
Know the answer?
Add Answer to:
can someone help me with this two questions please thank you 4. Find a recurrence relation...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT