Pippenger N.H. (2002) Expected Acceptance Counts for Finite Automata with Almost Uniform Input. In: Bose P., Morin P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg
If a sequence of independent unbiased random bits is fed into a finite automaton, it is straightforward to calculate the expected number of acceptances among the first n prefixes of the sequence. This paper deals with the situation in which the random bits are neither independent nor unbiased, but are nearly so. We show that, under suitable assumptions concerning the automaton, if the the difference between the entropy of the first n bits and n converges to a constant exponentially fast, then the change in the expected number of acceptances also converges to a constan texponentially fast. We illustrate this result with a variety of examples in which numbers folio wing the reciprocal distribution, whidi governs the significands of floating-point numbers, are recoded in the execution of various multiplication algorithms.