ML Anthology

Identification of Function Distinguishable Languages

Henning Fernau
ALT 2000 pp. 116-130
doi:10.1007/3-540-40992-0_9 /alt/2000/fernau2000alt-identification/

Abstract

We show how appropriately chosen functions which we call distinguishing can be used to make deterministic finite automata backward deterministic. These ideas can be exploited to design regular language classes identifiable in the limit from positive samples. Special cases of this approach are the k-reversible and terminal distinguishable languages as discussed in [ 1 ],[ 8 ],[ 10 ],[ 17 ],[ 18 ].

PDF ALT Semantic Scholar

Cite

Text

Fernau. "Identification of Function Distinguishable Languages." International Conference on Algorithmic Learning Theory, 2000. doi:10.1007/3-540-40992-0_9

Markdown

[Fernau. "Identification of Function Distinguishable Languages." International Conference on Algorithmic Learning Theory, 2000.](https://mlanthology.org/alt/2000/fernau2000alt-identification/) doi:10.1007/3-540-40992-0_9

BibTeX

@inproceedings{fernau2000alt-identification,
  title     = {{Identification of Function Distinguishable Languages}},
  author    = {Fernau, Henning},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2000},
  pages     = {116-130},
  doi       = {10.1007/3-540-40992-0_9},
  url       = {https://mlanthology.org/alt/2000/fernau2000alt-identification/}
}