Algorithms for learning regular expressions from positive data |
| |
Authors: | Henning Fernau |
| |
Affiliation: | Universität Trier, FB 4, Abt. Informatik, Germany |
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|