Probabilistic automata and simulation
β Scribed by N. V. Yarovitskii; N. I. Kostina
- Publisher
- Springer US
- Year
- 1993
- Tongue
- English
- Weight
- 757 KB
- Volume
- 29
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A model to generate synthetic series of hourly exposure of global radiation is proposed. This model has been constructed using a machine learning approach. It is based on the use of a subclass of probabilistic finite automata which can be used for variable-order Markov processes. This model allows u
A relaxed notion of category is presented having in mind the categorical caracterization of the mechanisms for combining probabilistic automata, since the composition of the appropriate morphisms is not always de ned. A detailed discussion of the required notion of morphism is provided. The partiali
Let Z\* be the set of all tapes over X and let ~b be a function ~: Z\* --~ [0, 1]. The problem of approximating such functions (which can be defined, in particular, by probabilistic automata) by nonprobabilistic automata is investigated, in several aspects.