“…Consider = ⟨ 0 , , ⟩, where 0 and are the same, as in the Example 5, and filter = {(eur) > 7, (rur) = min}, that means ̅ would include collections, created by all possible chains of currency exchange, that contain more than 7 euros, and minimal sum of rubles. According to (9), (18) - (20) and (26), STMS, generated by application of FMG , would contain, at least, multiset {9 ⋅ (eur), 1 ⋅ (usd)}, because it includes multiobject 9 ⋅ (eur) satisfying boundary condition (eur) > 7, as well as MO 0 ⋅ (rur) with absolutely minimal multiplicity 0, thus satisfying optimizing condition (rur) = min. (Remind, that (rur) ∉ is equivalent to 0 ⋅ (rur) ∈ ).∎ As may be seen, generation of set of terminal multisets by application of filtering multiset grammar is nothing but knowledge-and goal-driven computation.…”