Post a New Question

math

posted by .

How many strings of length 13 can be formed from 9 1's, two ('s and two )'s such that the substring () never occurs, and for k=1,2, we see k('s before k)'s?

Answer This Question

First Name
School Subject
Your Answer

Related Questions

More Related Questions

Post a New Question