Matrix approach to simplification of finite state machines using semi-tensor product of matrices
From MaRDI portal
Publication:6570397
DOI10.1002/ASJC.2123MaRDI QIDQ6570397FDOQ6570397
Authors: Jumei Yue, Y. Y. Yan, Zengqiang Chen 
Publication date: 10 July 2024
Published in: Asian Journal of Control (Search for Journal in Brave)
finite automatasemi-tensor product of matricesfinite state machineslogical systemsmatrix approachfinite-valued systems
Cites Work
- An introduction to semi-tensor product of matrices and its applications
- Controllability and observability of Boolean control networks
- Finite automata theory with membership values in lattices
- Title not available (Why is that?)
- Output tracking control of Boolean control networks via state feedback: constant reference signal case
- Solvability of \(k\)-track assignment problem: a graph approach
- On the complexity of minimizing probabilistic and quantum automata
- Cycles of periodically time-variant Boolean networks
- Automata, Boolean matrices, and ultimate periodicity.
- Feedback control design for the complete synchronisation of two coupled Boolean networks
- A novel matrix approach to observability analysis of finite automata
- A Finite Convergence Criterion for the Discounted Optimal Control of Stochastic Logical Networks
- Algebraic state space approach to model and control combined automata
- Incomplete logical control system and its application to some intellectual problems
- STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
- Cooperative tasking for deterministic specification automata
This page was built for publication: Matrix approach to simplification of finite state machines using semi-tensor product of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570397)
