Learning Regular Expressions from Representative Examples and Membership Queries

Authors

Efim Kinber, Sacred Heart UniversityFollow

Document Type

Conference Proceeding

Publication Date

2010

Abstract

A learning algorithm is developed for a class of regular expressions equivalent to the class of all unionless unambiguous regular expressions of loop depth 2. The learner uses one representative example of the target language (where every occurrence of every loop in the target expression is unfolded at least twice) and a number of membership queries. The algorithm works in time polynomial in the length of the input example.

Comments

2010 International Colloquium on Grammatical Inference.

Part of the Lecture Notes in Computer Science book series, vol. 6339.

ISBN: 9783642154874

DOI

10.1007/978-3-642-15488-1_9

Recommended Citation

Kinber E. (2010). Learning regular expressions from representative examples and membership queries. In J. M. Sempere, & P. García (Eds.), Grammatical inference: Theoretical results and applications. Springer. Doi: 10.1007/978-3-642-15488-1_9