A syntactic characterization of bounded-rank decision trees in terms of decision lists
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, p. 149-158
@article{ITA_1997__31_2_149_0,
     author = {Galesi, Nicola},
     title = {A syntactic characterization of bounded-rank decision trees in terms of decision lists},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {2},
     year = {1997},
     pages = {149-158},
     zbl = {0876.68092},
     mrnumber = {1462584},
     language = {en},
     url = {http://http://www.numdam.org/item/ITA_1997__31_2_149_0}
}
Galesi, Nicola. A syntactic characterization of bounded-rank decision trees in terms of decision lists. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 2, pp. 149-158. http://www.numdam.org/item/ITA_1997__31_2_149_0/

1. A. Blum, Rank-ϒ decision trees are a subclass of ϒ-decision lists, Information Processing Letters, 1992, 42, pp. 183-185. | MR 1170878 | Zbl 0773.68059

2. A. Ehrenfeucht and D. Haussler, Learning decision trees from random examples, Information and Computation, 1989, 82, pp. 231-246. | MR 1016682 | Zbl 0679.68157

3. R. L. Rivest, Learning decision lists, Machine Learning, 1987, 2, pp. 223-246.