In this paper, we consider classes of decision tables with many-valued decisions closed under operations of removal of columns, changing of decisions, permutation of columns, and duplication of columns. We study relationships among three parameters of these tables: the complexity of a decision table (if we consider the depth of decision trees, then the complexity of a decision table is the number of columns in it), the minimum complexity of a deterministic decision tree, and the minimum complexity of a nondeterministic decision tree. We consider rough classification of functions characterizing relationships and enumerate all possible seven types of the relationships.

翻译：本文研究在多值决策条件下，对移除列、改变决策、列置换及列复制操作封闭的决策表类。我们考察这些表格的三个参数之间的关系：决策表的复杂度（若考虑决策树深度，则决策表复杂度为其列数）、确定性决策树的最小复杂度，以及非确定性决策树的最小复杂度。我们采用粗糙分类方法分析表征这些关系的函数，并枚举所有可能的七种关系类型。