Abstract
An efficient method for simplifying a multivalued SULM network is presented in this paper. This method employs a cascade decomposition on a multivalued sequential machineM. At first we decomposeM into two simpler machinesM/π andM′. Instead of the traditional normal tree type network, a simpler SULM network that can realizeM can be constructed by cascadingM/π andM′.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
