In this paper, we consider decision trees that use both queries based on one attribute each and queries based on hypotheses about values of all attributes. Such decision trees are similar to ones studied in exact learning, where not only membership but also equivalence queries are allowed. For n = 3,..., 6, we compare decision trees based on various combinations of attributes and hypotheses for sorting n pairwise different elements from linearly ordered set.
|Original language||English (US)|
|Title of host publication||29th International Workshop on Concurrency, Specification and Programming, CS and P 2021|
|Number of pages||5|
|State||Published - Jan 1 2021|