Abstract
The semi-tensor product (STP) of matrices was used in the article, as a new matrix analysis tool, to investigate the problem of verification of self-verifying automata (SVA). SVA is a special variant of finite automata which is essential to nondeterministic communication with a limited number of advice bits. The status, input and output symbols are expressed in vector forms, the dynamic behaviour of SVA is modelled as an algebraic equation of the states and inputs, in which the matrix product is STP. By such algebraic formulation, three necessary and sufficient conditions are presented for the verification problem, by which three algorithms are established to find out all the strings which are accepted, rejected, or unrecognized by a SVA. Testing examples show the correctness of the results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The Journal of China Universities of Posts and Telecommunications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
