Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
Automatic average-case analysis of algorithms
Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Automata, Languages, and Machines
Automata, Languages, and Machines
Theory of Codes
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Using Generating Functions to Compute Concurrency
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
A Mathematical Theory of Communication
A Mathematical Theory of Communication
| Hi-index | 0.01 |
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.