Algorithms for learning regular expressions from positive data

We describe algorithms that directly infer very simple forms of 1-unambiguous regular expressions from positive data. Thus, we characterize the regular language classes that can be learned this way, both in terms of regular expressions and in terms of (not necessarily minimal) deterministic finite automata.

Authors

• Henning Fernau

Keywords

• Regular expressions
• Identification in the limit from positive data
• Text learning