MINIMAL JOIN GRAPH SUBSETS SYNTHESIS SYSTEM
Two-stage scheme for minimal join graph subsets synthesis that involves the construction of three sets (stereoseparators, their possessions and necessary edges) over given subalphabet set with subsequent construction a set of a certain kind of sinews for each stereo-separator. Systematized algorithms, implementing both stages, are systematized and their complexity is estimated.