Abstract
We show that finite-state machines can be represented as unique elements of special modules of functions. We obtain a module representation for the machine with the least number of states over a class of equivalent machines. We present a unique factorization of this representation. We construct an array which characterizes all state transitions and is identical for all machines in the equivalence class. Further, we show that the module representation for any finite-state machine is contained in a free submodule, and can be written as a linear combination of elements of submodules obtained from equivalent machine states. Module representations and associated arrays are given for two examples.
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 callDisclaimer: 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.
