Identifying Unrecognizable Regular Languages by Queries
Abstract
We describe a new technique useful in identifying a subclass of regular trace languages (defined on a free partially commutative monoid). We extend an algorithm defined by Dana Angluin in 1987 for DFA's and using equivalence and membership queries. In trace languages the words are equivalence classes of strings, and we show how to extract, from a given class, a string that can drive the original learning algorithm. In this way we can identify a class of regular trace languages which includes languages which are not recognizable by any automaton.
Cite
Text
Ferretti and Mauri. "Identifying Unrecognizable Regular Languages by Queries." European Conference on Machine Learning, 1994. doi:10.1007/3-540-57868-4_72Markdown
[Ferretti and Mauri. "Identifying Unrecognizable Regular Languages by Queries." European Conference on Machine Learning, 1994.](https://mlanthology.org/ecmlpkdd/1994/ferretti1994ecml-identifying/) doi:10.1007/3-540-57868-4_72BibTeX
@inproceedings{ferretti1994ecml-identifying,
title = {{Identifying Unrecognizable Regular Languages by Queries}},
author = {Ferretti, Claudio and Mauri, Giancarlo},
booktitle = {European Conference on Machine Learning},
year = {1994},
pages = {355-358},
doi = {10.1007/3-540-57868-4_72},
url = {https://mlanthology.org/ecmlpkdd/1994/ferretti1994ecml-identifying/}
}