Abstract
In this paper, we discuss the underlying ideas of a computer laboratory for symbolic manipulation of discrete random experiments. Finite automata, and associated formal series, are the basic theoretical tool for representing experiments, and for solving probability problems. Starting from a description of a random experiment given as a special kind of regular expressions, the environment constructs automata from which it extracts generating series associated to the experiment.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A., Hopcroft, J., Ullman, J., The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
Beaulieu, M.C., Langages rationnels et probabilités discrétes, Mémoire de Maitrise, Université du Québec á Montréal, 1998.
Berstel, J., Perrin, D., Theory of Codes, Academic Press, 1985.
Berstel, J., Reutenauer, C., Les séries rationnelles et leurs langages, Masson, 1984.
Eilenberg, S., Automata, Languages and Machines, Vol A, Academic Press, 1974.
Flajolet, P., Salvy, B., Zimmermann, P., Automatic Average-Case Analysis of Algorithms, Theoretical Computer Science 79, 1991, 37–109.
Geniet, D., Thimonnier L., Using Generating Functions to Compute Concurrency, Fundamental of Computation Theory, LNCS 380, 1989, 185–196.
Hansel, G., Perrin, D., Rational Probability Measures, Theoretical Computer Science, 65, 1989, 171–188.
Penney, W., Problem 95: Penney-Ante, Journal of Recreational Mathematics, 7, 1974, 321.
Schtuzenberger, M. P., On the synchronizing properties of certain prefix codes, Inform. and Control 7, 1964, 23–36.
Shannon, C., The Mathematical Theory of Communication, The University of Illinois Press, Urbana, 1949.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beaulieu, MC., Bergeron, A. (1999). Automata and Computational Probabilities. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-48057-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66652-3
Online ISBN: 978-3-540-48057-0
eBook Packages: Springer Book Archive