Extensions of a MAT Learner for Regular Tree Languages


In an earlier paper, we proposed a learning algorithm for regular tree languages in the Minimal Adequate Teacher model and investigated its complexity from a theoretical perspective. Here, we focus on more practical issues. We discuss a concrete implementation made available on the web, which includes two extensions of the basic algorithm. In the paper, the… (More)


5 Figures and Tables

Cite this paper

@inproceedings{Drewes2006ExtensionsOA, title={Extensions of a MAT Learner for Regular Tree Languages}, author={Frank Drewes and Johanna H{\"o}gberg}, year={2006} }