%0 Journal Article
%A $authorName.trim()
%T Compatible-invariant subset analysis of deterministic finite automata via semi-tensor product of matrices approach
%D 2018
%R 10.19682/j.cnki.1005-8885.2018.0028
%J Journal of China Universities of Posts and Telecommunications
%P 75-82
%V 25
%N 5
%X <p>The compatible-invariant subset of deterministic finite automata (DFA) is investigated to solve the problem of subset stabilization under the frameworks of semi-tensor product (STP) of matrices. The concepts of compatible-invariant subset and largest compatible-invariant subset are introduced inductively for Moore-type DFA, and a necessary condition for the existence of largest compatible-invariant subset is given. Meanwhile, by using the STP of matrices, a compatible feasible event matrix is defined with respect to the largest compatible-invariant subset. Based on the concept of compatible feasible event matrix, an algorithm to calculate the largest compatible-invariant subset contained in a given subset is proposed. Finally, an illustrative example is given to validate the results.</p>
%U https://jcupt.bupt.edu.cn/EN/10.19682/j.cnki.1005-8885.2018.0028