Abstract
This paper is concerned with finding optimal decompositions of transformation graphs. These directed graphs can be regarded as state transition graphs of autonomous sequential networks.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
