Ask your own question, for FREE!
Mathematics 25 Online
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!
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!