Discrete-time machines in closed monoidal categories. I
From MaRDI portal
Publication:1216447
DOI10.1016/S0022-0000(75)80012-2zbMath0303.18002OpenAlexW1998351225MaRDI QIDQ1216447
Publication date: 1975
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(75)80012-2
Formal languages and automata (68Q45) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Categories of machines, automata (18B20)
Related Items (11)
Algebraic representation of dynamics and behavior for continuous-time linear systems ⋮ Universal realization ⋮ An abstract cell model that describes the self-organization of cell function in living systems ⋮ Nondeterministic syntactic complexity ⋮ Discrete-time machines in closed monoidal categories. I ⋮ ON THE ADJOINT SITUATIONS BETWEEN BEHAVIOUR AND REALIZATION ⋮ Parallel realization of systems, using factorizations and quotients in categories ⋮ Epimorphisms of free monoids ⋮ Schützenberger Products in a Category ⋮ Object-oriented hybrid systems of coalgebras plus monoid actions ⋮ Unnamed Item
Cites Work
- Group-like structures in general categories. I. Multiplications and comultiplications
- Discrete-time machines in closed monoidal categories. I
- Automata theory and control theory - a rapprochement
- On the relevance of abstract algebra to control theory
- Algebraic structures in linear systems theory
- Coherence in closed categories
- A reflection theorem for closed categories
- Adjoint Functors
- Minimal realization of machines in closed categories
- Monomorphisms, Epimorphisms, and Pull-Backs
- Ho's algorithm, commutative diagrams, and the uniqueness of minimal linear systems
- Realization is universal
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Discrete-time machines in closed monoidal categories. I
