
Electronic Proceedings of the Twenty-second Annual International Conference on Technology in Collegiate MathematicsChicago, Illinois, March 11-14, 2010Paper S054
This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twenty-second Annual International Conference on Technology in Collegiate Mathematics, ISBN 978-0-321-74614-6, Copyright (C) 2011 by Pearson Education, Inc. |
Further Maple Explorations of Forbidden Patterns in Coin Tossing |
Click to access this paper:
|
We use Maple, at a student project level, to continue our exploration of recurrence relations for enumerating bit strings not containing certain sub-strings. By using two differing theoretical approaches, and Maple for computations, we find unexpected patterns and theorems for some collections of forbidden sub-strings.
Keyword(s): Maple, applications