Skip to search formSkip to main contentSkip to account menu

Induction of regular languages

Known as: Regular expression induction, Finite automata learning, Regular expression learning 
In computational learning theory, induction of regular languages refers to the task of learning a formal description (e.g. grammar) of a regular… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Regular expressions have been widely studied due to their expressiveness and flexibility for various applications. A common yet… 
Highly Cited
2010
Highly Cited
2010
2010
2010
Regular Expressions have been used for Information Extraction tasks in a variety of domains. The alphabet of the regular… 
Highly Cited
2008
Highly Cited
2008
Regular expressions have served as the dominant workhorse of practical information extraction for several years. However, there… 
Highly Cited
2006
Highly Cited
2006
An international initiative aimed at the harmonization and validation of existing and future land cover datasets is needed to… 
2001
2001
We show how a genetic algorithm can be used for the inference of a regular language from a set of positive (and optionally also… 
Highly Cited
2000
Highly Cited
2000
For undergraduate or advanced undergraduate courses in Classical Natural Language Processing, Statistical Natural Language… 
Highly Cited
1994
Highly Cited
1994
In this research, inductive inference is done with an informant on the class of regular languages. The approach is to evolve…