Register
Let an equal the number of ternary strings of length n made up of Os, .ls, and 2s, such that the substrings 00, 01, 10, and 11 never occur. Prove that an = an-l + 2an-2, (n 2: 2), with ao = 1 and al =3.
54.0k views
0 votes
Let an equal the number of ternary strings of length n made up of Os, .ls, and 2s, such that the substrings 00, 01, 10, and 11 never occur. Prove that an = an-l + 2an-2, (n 2: 2), with ao = 1 and al =3. Then find a formula for

User Ahmad Boorghany
by
7.7k points

1 Answer

3 votes

Answer:

Please see attachment

Explanation:

Please see attachment

Let an equal the number of ternary strings of length n made up of Os, .ls, and 2s-example-1
User Szamanm
by
8.0k points
← Prev Question Next Question →

Related questions

Ask a Question
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Other Questions

What is .725 as a fraction
How do you estimate of 4 5/8 X 1/3
A bathtub is being filled with water. After 3 minutes 4/5 of the tub is full. Assuming the rate is constant, how much longer will it take to fill the tub?
i have a field 60m long and 110 wide going to be paved i ordered 660000000cm cubed of cement  how thick must the cement be to cover field
Write words to match the expression. 24- ( 6+3)
Link Copied!