Expected Acceptance Counts for Finite Automata with Almost Uniform Input

  • Nie Holas Pippenger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2518)


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.


Multiplication Algorithm Finite Automaton Probability Generate Function Sequential Machine Input String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B1]
    Booth, A. D.: A signed binary multiplication technique. Quart. J. Mech. Appl. Math., 4 (1951) 236–240zbMATHCrossRefMathSciNetGoogle Scholar
  2. [B2]
    Booth, A. D.: Review of “A proof of the modified Booth’s algorithm for multiplication” by Louis P. Rubinfeld. Math. Rev., 53 #4610Google Scholar
  3. [C]
    Chomsky, N., Miller, G. A.: Finite-state languages. Inform, and Control, 1 (1958) 91–112CrossRefMathSciNetzbMATHGoogle Scholar
  4. [F1]
    Freiman, C. V.: Statistical analysis of certain binary division algorithms. Proc. IRE, 49 (1961) 91–103CrossRefMathSciNetGoogle Scholar
  5. [F2]
    Frougny, C: On-the-fly algorithms and sequential machines. IEEE Trans, on Computers, 49 (2000) 859–863CrossRefMathSciNetGoogle Scholar
  6. [H]
    Hamming, R. W.: On the distribution of numbers. Bell System Tech. J., 49 (1970) 1609–1625MathSciNetzbMATHGoogle Scholar
  7. [M]
    MacSorley, O. L.: High-speed arithmetic in binary computers. Proc. IRE, 49 (1961) 67–91CrossRefMathSciNetGoogle Scholar
  8. [N]
    Newcomb, S.: Note on the frequency of use of the different digits in natural numbers,. Amer. J. Math., 4 (1881) 39–40CrossRefMathSciNetGoogle Scholar
  9. [S]
    Shannon, C. E.: A mathematical theory of communication. Bell System Tech. J., 27 (1948) 379–423, 623–655MathSciNetGoogle Scholar
  10. [T]
    Tocher, K. D.: Techniques of multiplication and division for automatic binary computers. Quart. J. Mech. Appl. Math., 11 (1958) 364–384zbMATHCrossRefMathSciNetGoogle Scholar
  11. [W1]
    Wallis, J.: Arithmetica infinitorum. Oxford, 1656Google Scholar
  12. [W2]
    Whittaker, E. T., Watson, G. N.: A course of modern analysis. Cambridge, 1963Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Nie Holas Pippenger
    • 1
  1. 1.Department of Computer ScienceUniversity of British ColumbiaVancouverCanada

Personalised recommendations