Transform Mechanism Between PLMs and Scalars: An Answer to the Open Question on Extension of Method for Reducing Storage Complexity of FSMs

This brief answers the open question on extension of a method that reduces the storage complexity of deterministic finite state machines (DFSMs) to nondeterministic finite state machines (NFSMs) within the framework of semi-tensor product of matrices (STP). The solution is designing two mappings from pseudo logical matrices (PLMs) to pseudo logical vectors (PLVs) and from scalars to PLVs, by which the method can be extended to reduce the storage complexity of NFSMs within the framework of STP.