A generalized minimal realization theory of machines in a category.
Stochastica, Tome 7 (1983) no. 1, p. 17.
Voir la notice de l'article dans European Digital Mathematics Library
This paper presents a generalized minimal realization theory of machines in a category which contains the Kleiski case. The minimal realization is the cheapest realization for a given cost functor. The final reachable realization of Arbib and Manes ([5]) and the minimal state approach for nondeterministic machines are included here.
Classification :
68Q45, 68Q70, 18B20
Mots-clés : Autómatas, Categoría algebraica, cost functor, final reachable realization, minimal state approach, nondeterministic machines
Mots-clés : Autómatas, Categoría algebraica, cost functor, final reachable realization, minimal state approach, nondeterministic machines
@article{STO_1983__7_1_38876, author = {Antonio Bahamonde}, title = {A generalized minimal realization theory of machines in a category.}, journal = {Stochastica}, pages = {17}, publisher = {mathdoc}, volume = {7}, number = {1}, year = {1983}, mrnumber = {MR0766888}, zbl = {0558.68048}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/STO_1983__7_1_38876/} }
Antonio Bahamonde. A generalized minimal realization theory of machines in a category.. Stochastica, Tome 7 (1983) no. 1, p. 17. https://geodesic-test.mathdoc.fr/item/STO_1983__7_1_38876/