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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation 75, 87–106 (1987)
Angluin, D.: Queries and Concept Learning. Machine Learning 2, 319–342 (1988)
Book, R., Even, S., Greibach, S., Ott, G.: Ambiguity in Graphs and Expressions. IEEE Transactions on Computers. C-20(2), 149–153 (1971)
Brāzma, A.: Efficient Identification of Regular Expressions from Representative Examples. In: 6th Annual ACM Conference on Comp. Learning Theory, pp. 236–242. ACM Press, New York (1993)
Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of Concise DTDs from XML Data. In: Proceedings of the 32nd International Conference on VLDB, pp. 115–126. ACM Press, New York (2006)
Brüggemann-Klein, A., Wood, D.: One-Unambiguous Regular Languages. Information and Computation 142(2), 182–206 (1998)
Fernau, H.: Algorithms for Learning Regular Expressions from Positive Data. Information and Computation 207(4), 521–541 (2009)
Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447–474 (1967)
Kinber, E.: On Learning Regular Expressions and Patterns. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol. 5278, pp. 125–138. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kinber, E. (2010). Learning Regular Expressions from Representative Examples and Membership Queries. In: Sempere, J.M., García, P. (eds) Grammatical Inference: Theoretical Results and Applications. ICGI 2010. Lecture Notes in Computer Science(), vol 6339. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15488-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-15488-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15487-4
Online ISBN: 978-3-642-15488-1
eBook Packages: Computer ScienceComputer Science (R0)