Learning Grammars and Automata with Queries

DOI10.1007/978-3-662-48395-4_3zbMath1404.68062OpenAlexW2478519018MaRDI QIDQ2963594

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Characteristic sets for polynomial grammatical inference
• Queries revisited.
• Oracles and queries that are sufficient for exact learning
• Inference of finite automata using homing sequences
• A theory of the learnable
• On the complexity of minimum inference of regular sets
• Model-based learning of interaction strategies in multi-agent systems
• A note on the number of queries needed to identify regular languages
• Language identification in the limit

This page was built for publication: Learning Grammars and Automata with Queries