Expected Acceptance Counts for Finite Automata with Almost Uniform Input

Nicholas Pippenger. Expected Acceptance Counts for Finite Automata with Almost Uniform Input. In Prosenjit Bose, Pat Morin, editors, Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings. Volume 2518 of Lecture Notes in Computer Science, pages 636-646, Springer, 2002. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.