Efficient learning of regular expressions from good examples

DOI10.1007/3-540-58520-6_55MaRDI QIDQ4470536zbMATH OpenFDO

Authors A. Brazma, Kārlis Čerāns

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58520-6_55

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 980420
• Learning regular expressions from representative examples and membership queries
• Algorithms for learning regular expressions from positive data
• Discovering unbounded unions of regular pattern languages from positive examples
• Learning regular sets from queries and counterexamples

Cited in

(11)

• Algorithms for learning regular expressions from positive data
• Recent advances of grammatical inference
• Fast learning of restricted regular expressions and dtds
• Learning to identify concise regular expressions that describe email campaigns
• Constructing simply recursive programs from a finite set of good examples
• Cardinality estimates for some classes of regular languages
• Inferring deterministic regular expression with unorder
• Learning regular expressions from representative examples and membership queries
• scientific article; zbMATH DE number 980420 (Why is no real title available?)
• Checking linearizability of concurrent priority queues
• Grammatical inference: An old and new paradigm

This page was built for publication: Efficient learning of regular expressions from good examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470536)