ML Anthology

Algorithms for Learning Regular Expressions

Henning Fernau
ALT 2005 pp. 297-311
doi:10.1007/11564089_24 /alt/2005/fernau2005alt-algorithms/

Abstract

We describe algorithms that directly infer regular expressions from positive data and characterize the regular language classes that can be learned this way.

PDF ALT Semantic Scholar

Cite

Text

Fernau. "Algorithms for Learning Regular Expressions." International Conference on Algorithmic Learning Theory, 2005. doi:10.1007/11564089_24

Markdown

[Fernau. "Algorithms for Learning Regular Expressions." International Conference on Algorithmic Learning Theory, 2005.](https://mlanthology.org/alt/2005/fernau2005alt-algorithms/) doi:10.1007/11564089_24

BibTeX

@inproceedings{fernau2005alt-algorithms,
  title     = {{Algorithms for Learning Regular Expressions}},
  author    = {Fernau, Henning},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2005},
  pages     = {297-311},
  doi       = {10.1007/11564089_24},
  url       = {https://mlanthology.org/alt/2005/fernau2005alt-algorithms/}
}