“…Given H, A, and G with H A G that generate K, C, and L (G), respectively, a closed language property ϖ, and a set Ψ, we generalize the algorithm introduced in our previous work [22] for calculating the supremal controllable and relatively network obsetvable suablanguage to calculate the supremal controllable and ϖ-preserved sublanguage in Algorithm 1. ϖ can be but is not limited to, normality [3], weakly normality [5], relative observability [7], strong observability [6], relative network observability [22], and relative delay observability. Clearly, the problem solved in our previous work [22] is one of the problems solved by the algorithm introduced in this paper. In other words, the algorithm introduced in this paper is more general.…”