Decision lists over regular patterns
✍ Scribed by Steffen Lange; Jochen Nessel
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 200 KB
- Volume
- 298
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
✦ Synopsis
The paper introduces the notion of decision lists over regular patterns. This formalism provides a strict extension of regular erasing pattern languages and of containment decision lists.
Formal properties of the resulting language class, a subclass of the regular languages, are investigated. In particular, we show that decision lists over regular patterns have exactly the same expressive power as decision trees over regular patterns.
Moreover, we study the learnability of the resulting language class within di erent formal settings including Gold's model of learning in the limit as well as Valiant's model of approximately correct learning.
📜 SIMILAR VOLUMES
The reaction mixture was heated under alternate vacuum and argon atmospheres for 30 min at 155 °C, when TOP-Se (selenium dissolved in TOP; 10 mL, 1 M) was rapidly injected into the reaction flask leading to very fast nucleation and growth of the PbSe NCs. The resulting NCs, withdrawn in several aliq