Thursday
July 2, 2015

Homework Help: math

Posted by Anonymous on Tuesday, July 30, 2013 at 12:10pm.

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:
Answer:

Related Questions

More Related Questions

Members