5. Applications of Rational and Meromorphic Asymptotics
V.1 A roadmap to rational and meromorphic asymptotics
V.2 The supercritical sequence schema
V.3 Regular specifications and languages
V.4 Nested sequences, lattice paths, and continued fractions
V.5 Paths in graphs and automata
V.6 Transfer matrix models
Program V.1In the style of the plots in the Lecture 6, plot the GFs for the set of bitstrings having no occurrence of the pattern 0000000001. Do the same for 0101010101. (See Web Exercise V.1 and Program IV.2).