Abstract
Research in the field of grammatical inference deals with learnability of languages. In general, the setup is as follows. Given a family of languages, one specific language is selected and a set of sample strings is extracted. The learner now has to identify the language, from the family of languages, that was used to generate the sample strings.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Heinz, J., de la Higuera, C., van Zaanen, M. (2016). Learning Non-Regular Languages. In: Grammatical Inference for Computational Linguistics. Synthesis Lectures on Human Language Technologies. Springer, Cham. https://doi.org/10.1007/978-3-031-02159-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-02159-6_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-01031-6
Online ISBN: 978-3-031-02159-6
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 6