Algebraic state space approach to model and control combined automata

DOI10.1007/S11704-016-5128-ZzbMath1403.68132OpenAlexW2566596569MaRDI QIDQ1712571

Jumei Yue, Yongyi Yan, Zeng-Qiang Chen

Publication date: 22 January 2019

Published in: Frontiers of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11704-016-5128-z

zbMATH Keywords

controllabilityautomatacompositionsemi-tensor productalgebraic state-space approach

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70)

Related Items (1)

Algebraic method of simplifying Boolean networks using semi‐tensor product of Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• Stability of switched polynomial systems
• Semi-tensor product of matrices and its application to Morgen's problem
• Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
• Automata, Boolean matrices, and ultimate periodicity.
• Controllability and optimal control of a temporal Boolean network
• Limited Automata and Context-Free Languages
• Parameterized complexity of basic decision problems for tree automata
• Layered Composition for Timed Automata
• Restarting automata with auxiliary symbols restricted by lookahead size
• On dynamics of automata with a stack
• Switching and Finite Automata Theory
• Disturbance Decoupling of Boolean Control Networks
• Multiple Fuzzy Relation and Its Application to Coupled Fuzzy Control

This page was built for publication: Algebraic state space approach to model and control combined automata