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.
Cite
CITATION STYLE
Beaulieu, M. C., & Bergeron, A. (1999). Automata and computational probabilities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1660, pp. 164–177). Springer Verlag. https://doi.org/10.1007/3-540-48057-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
