The Determination of Synchronous Sequence of(Linear) Finite Automata Based on Its Matrix Model
Nan Yang · Shuxue de shijian yu renshi · 2011
Based on the matrix model of a finite automata and with the tools of the matrix theory and the Boolean algebra,this paper gives out the new sufficient and necessary conditions which determine whether input sequences are the synchronous sequence of(linear) finite automata and the new algorithm.which solves the shortest synchronous sequence of the linear finite automata.