Skip to main content
Conference Proceedings

Algorithms for learning regular expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3734 LNAI 297-311
DOI: 10.1007/11564089_24
17Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe algorithms that directly infer regular expressions from positive data and characterize the regular language classes that can be learned this way. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fernau, H. (2005). Algorithms for learning regular expressions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3734 LNAI, pp. 297–311). https://doi.org/10.1007/11564089_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free