Matrix approach to simplification of finite state machines using semi-tensor product of matrices
From MaRDI portal
Recommendations
- Semi-tensor product of matrices approach to reachability of finite automata with application to language recognition
- A method for minimizing Moore finite-state machines by merging two states
- scientific article; zbMATH DE number 1174493
- Publication:4332902
- Minimization of incompletely specified Mealy finite-state machines by merging two internal states
Cites work
- A Finite Convergence Criterion for the Discounted Optimal Control of Stochastic Logical Networks
- A novel matrix approach to observability analysis of finite automata
- Algebraic state space approach to model and control combined automata
- An introduction to semi-tensor product of matrices and its applications
- Automata, Boolean matrices, and ultimate periodicity.
- Controllability and observability of Boolean control networks
- Cooperative tasking for deterministic specification automata
- Cycles of periodically time-variant Boolean networks
- Feedback control design for the complete synchronisation of two coupled Boolean networks
- Finite automata theory with membership values in lattices
- scientific article; zbMATH DE number 3420624 (Why is no real title available?)
- Incomplete logical control system and its application to some intellectual problems
- On the complexity of minimizing probabilistic and quantum automata
- Output tracking control of Boolean control networks via state feedback: constant reference signal case
- Solvability of k-track assignment problem: a graph approach
- STP Approach to Model Controlled Automata with Application to Reachability Analysis of DEDS
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)
