Learning regular tree languages from correction and equivalence queries

DOI10.25596/JALC-2007-501zbMATH Open1145.68463MaRDI QIDQ3515225FDOQ3515225

Authors: Cătălin Ionuţ Tîrnăucă, Cristina Tîrnăucă 

Publication date: 29 July 2008

Recommendations

• Query learning of regular tree languages: How to avoid dead states
• Algorithmic Learning Theory
• Learning tree languages from positive examples and membership queries
• scientific article; zbMATH DE number 2040913
• scientific article; zbMATH DE number 2089360

zbMATH Keywords

weight functionlearning from queriescorrecting context

Mathematics Subject Classification ID

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

Cited In (9)

• Learning grammars and automata with queries
• Query learning of regular tree languages: How to avoid dead states
• On Learning Regular Expressions and Patterns Via Membership and Correction Queries
• Error-correcting tree language inference
• Learning tree languages from positive examples and membership queries
• A Note on the Relationship between Different Types of Correction Queries
• Title not available (Why is that?)
• Learning Tree Languages
• Title not available (Why is that?)

This page was built for publication: Learning regular tree languages from correction and equivalence queries

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