Cost functors and optimal realization

DOI10.1016/0022-0000(85)90047-9zbMath0614.68044OpenAlexW2151968360MaRDI QIDQ1819936

Antonio Bahamonde

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90047-9

zbMATH Keywords

stochastic automataoptimal realizationArbib-Manes approachautomata in a categorycategory of dynamicscost functorsgeneralized minimal realization principleinput process

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Related Items (2)

An algorithm to minimize representations of finite order relations ⋮ Inductive properties of lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Foundations of system theory: The Hankel matrix
• Adjoint machines, state-behavior machines, and duality
• Realization theory for automata in categories
• Coequalizers and free triples
• Good state transition policies for nondeterministic and stochastic automata
• Fuzzy machines in a category
• Machines in a Category: An Expository Introduction
• Realization is universal

This page was built for publication: Cost functors and optimal realization