Cost functors and optimal realization
From MaRDI portal
Based on the Arbib-Manes approach to automata in a category, this article aims to provide a general theory of so-called optimal realization, in order to include minimum information-theoretic dispersion and optimal prediction for stochastic automata. Optimal realization is to be understood with respect to cost functors as introduced in this paper; sufficient conditions for the existence of such a realization are given.
Cites work
- A Mathematical Theory of Communication
- Adjoint machines, state-behavior machines, and duality
- Coequalizers and free triples
- Foundations of system theory: The Hankel matrix
- Fuzzy machines in a category
- Good state transition policies for nondeterministic and stochastic automata
- scientific article; zbMATH DE number 3811814 (Why is no real title available?)
- scientific article; zbMATH DE number 3681970 (Why is no real title available?)
- scientific article; zbMATH DE number 3769855 (Why is no real title available?)
- scientific article; zbMATH DE number 3455154 (Why is no real title available?)
- scientific article; zbMATH DE number 3296291 (Why is no real title available?)
- scientific article; zbMATH DE number 3365976 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- scientific article; zbMATH DE number 3399453 (Why is no real title available?)
- Machines in a Category: An Expository Introduction
- Realization is universal
- Realization theory for automata in categories
Cited in
(5)
This page was built for publication: Cost functors and optimal realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819936)