On the relevance of abstract algebra to control theory
From MaRDI portal
Publication:2540643
DOI10.1016/0005-1098(69)90026-0zbMath0199.49303OpenAlexW2008285256MaRDI QIDQ2540643
Michael A. Arbib, H. P. Zeiger
Publication date: 1969
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(69)90026-0
Linear systems in control theory (93C05) Controllability, observability, and system structure (93B99)
Related Items
Varieties and covarieties of languages (extended abstract) ⋮ Machines in a category ⋮ Convolution and module theory of linear systems† ⋮ Realization is universal ⋮ FUZZY SYSTEMS AND ARTIFICIAL INTELLIGENCE ⋮ The dual equivalence of equations and coequations for automata ⋮ Algebra-coalgebra duality in brzozowski's minimization algorithm ⋮ Foundations of system theory: Decomposable systems ⋮ Discrete-time machines in closed monoidal categories. I ⋮ Minimal realization of machines in closed categories ⋮ Adjoint machines, state-behavior machines, and duality ⋮ Categories in systems and control theory ⋮ Methods of invariant analysis for linear control systems. ⋮ Algebraic structures in linear systems theory ⋮ Steady-state optimal control of finite-state machines ⋮ System identification via state characterization ⋮ Robust Stability of Input-Output Systems with Initial Conditions ⋮ Structure and complexity in economic and social systems ⋮ Coproducts and decomposable machines ⋮ Abstract Models for Systems Identification ⋮ On the semigroups of linear sequential machines ⋮ Some topics in algebraic systems theory: a survey†
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automata theory and control theory - a rapprochement
- Sequential Functions
- Linear Automaton Transformations
- Controllability and Observability in Multivariable Control Systems
- ALGEBRAIC STRUCTURE OF LINEAR DYNAMICAL SYSTEMS, I. THE MODULE OF Σ
- A Common Framework for Automata Theory and Control Theory
- Mathematical Description of Linear Dynamical Systems
- Automaton automorphisms
- Algebra automata I: Parallel programming as a prolegomena to the categorical approach
- Ho's algorithm, commutative diagrams, and the uniqueness of minimal linear systems