A Syntactic characterization of bounded-rank decision trees in terms of decision lsts
Decision lists and decision trees are two models of computation for boolean functions. Blum has shown (Information Processing Letters 42 (1992), 183-185) that rank-k decision trees are a subclass of decision lists. Here we identify precisely, by giving a syntactical characterization, the subclass of...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1996 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96436 |
| Acceso en línea: | https://hdl.handle.net/2117/96436 |
| Access Level: | acceso abierto |
| Palabra clave: | Decision lists Decision trees Syntactical characterization Àrees temàtiques de la UPC::Informàtica::Programació |
| Sumario: | Decision lists and decision trees are two models of computation for boolean functions. Blum has shown (Information Processing Letters 42 (1992), 183-185) that rank-k decision trees are a subclass of decision lists. Here we identify precisely, by giving a syntactical characterization, the subclass of decision lists which correspond exactly to the class of bounded rank decision trees. Furthermore we give a more general algorithm to recover reduced decision trees from decision lists. |
|---|