Learning Erasing Pattern Languages with Queries
Abstract
A pattern is a finite string of constant and variable symbols. The non-erasing language generated by a pattern is the set of all strings of constant symbols that can be obtained by substituting non-empty strings for variables. In order to build the erasing language generated by a pattern, it is also admissible to substitute the empty string. The present paper deals with the problem of learning erasing pattern languages within Angluin’s model of learning with queries. Moreover, the learnability of erasing pattern languages with queries is studied when additional information is available. The results obtained are compared with previously known results concerning the case that non-erasing pattern languages have to be learned.
Cite
Text
Nessel and Lange. "Learning Erasing Pattern Languages with Queries." International Conference on Algorithmic Learning Theory, 2000. doi:10.1007/3-540-40992-0_7Markdown
[Nessel and Lange. "Learning Erasing Pattern Languages with Queries." International Conference on Algorithmic Learning Theory, 2000.](https://mlanthology.org/alt/2000/nessel2000alt-learning/) doi:10.1007/3-540-40992-0_7BibTeX
@inproceedings{nessel2000alt-learning,
title = {{Learning Erasing Pattern Languages with Queries}},
author = {Nessel, Jochen and Lange, Steffen},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2000},
pages = {86-100},
doi = {10.1007/3-540-40992-0_7},
url = {https://mlanthology.org/alt/2000/nessel2000alt-learning/}
}