Learning grammars and automata with queries

DOI10.1007/978-3-662-48395-4_3zbMATH Open1404.68062OpenAlexW2478519018MaRDI QIDQ2963594FDOQ2963594

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

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

Mathematics Subject Classification ID

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

Cites Work

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

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)