Timeline for Let $S_n$ be the number of binary strings of length = $n$ which do not contain the sub-string $010$. Find a recurrence relation for $S_n$.
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 28, 2011 at 20:37 | comment | added | Ondrej Janacek | I think there should be easier solution. Still, it is first example from seminar. Second is much more complicated. | |
| Nov 28, 2011 at 20:16 | comment | added | msh210 | @Andrew: Like I said: the OEIS comment indicates how to do so. | |
| Nov 28, 2011 at 20:14 | comment | added | Ondrej Janacek | I do not need help with homework, I just missed last seminar and I have absolutely no idea, how to solve problem like this. | |
| Nov 28, 2011 at 20:11 | comment | added | msh210 | This answer assumes the asker is actually seeking a recurrence relation: it provides one. If, OTOH, the asker is actually seeking help with homework (as I suspect), then he'll (presumably) need to explain why the recurrence relation holds. In that case, he can check the proof in the OEIS comment. | |
| Nov 28, 2011 at 19:59 | history | answered | msh210 | CC BY-SA 3.0 |