Learning grammars and automata with queries

DOI10.1007/978-3-662-48395-4_3MaRDI QIDQ2963594zbMATH OpenOpenAlexFDO

Authors Colin de la Higuera

Publication date 15 February 2017

Published in Topics in Grammatical Inference (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48395-4_3

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Recommendations

• Learning regular tree languages from correction and equivalence queries
• scientific article; zbMATH DE number 2019602
• Grammatical inference. Learning automata and grammars.
• Queries and concept learning
• Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

Cites work

• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• A note on the number of queries needed to identify regular languages
• A theory of the learnable
• Characteristic sets for polynomial grammatical inference
• Inference of finite automata using homing sequences
• Language identification in the limit
• Learning balls of strings from edit corrections
• Model-based learning of interaction strategies in multi-agent systems
• On the complexity of minimum inference of regular sets
• Oracles and queries that are sufficient for exact learning
• Queries revisited.

Cited in

(5)

• Learning language intersections
• Learning erasing pattern languages with queries
• Automata techniques for query inference machines
• Learning infinite-word automata with loop-index queries
• Active Learning of Group-Structured Environments

This page was built for publication: Learning grammars and automata with queries

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