Ask your own question, for FREE!
Mathematics
OpenStudy (anonymous):

let T be the set of strings over the alphabet {0,1,2,3} which do not contain 12 as a substring. Give the recursion for the number h(n) of strings T of length n. Make sure to give initial values to get the recursion going.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Latest Questions
Vexiz: How do I get more subscribers on youtube?
1 day ago 7 Replies 1 Medal
urdaddy: Why was WW2 so important when it came to segregation?
1 day ago 1 Reply 1 Medal
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!