Algorithms for learning regular expressions from positive data
From MaRDI portal
Publication:1013092
DOI10.1016/j.ic.2008.12.008zbMath1170.68021OpenAlexW2080666934MaRDI QIDQ1013092
Publication date: 16 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.12.008
Related Items (5)
Fast learning of restricted regular expressions and dtds ⋮ Blocksequences of \(k\)-local words ⋮ On lengths of edge-labeled graph expressions ⋮ Learning from positive and negative examples: dichotomies and parameterized algorithms ⋮ Learning Tree Languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prudence and other conditions on formal language learning
- Efficient preprocessing of XML queries using structured signatures
- Deterministic generalized automata
- The validation of SGML content models
- Identification of function distinguishable languages.
- Formal properties of XML grammars and languages
- Incremental learning from positive data
- Generalized regular expressions - a language for synthesis of programs with branching in loops
- Finite Automata, Digraph Connectivity, and Regular Expression Size
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- Context-Free Grammars and XML Languages
- Inference of Reversible Languages
- Observations about bounded languages and developmental systems
- Inductive synthesis of dot expressions
- Set-driven and rearrangement-independent learning of recursive languages
- Algorithmic Learning Theory
- Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)
- Language identification in the limit
- Algorithmic Learning Theory
- One-unambiguous regular languages
This page was built for publication: Algorithms for learning regular expressions from positive data
