Towards General Algorithms for Grammatical Inference

DOI10.1007/978-3-642-16108-7_2zbMath1306.68051OpenAlexW2585741244MaRDI QIDQ4930686

Alexander Clark

Publication date: 1 October 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-16108-7_2

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42)

Related Items (5)

Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Distributional learning of conjunctive grammars and contextual binary feature grammars ⋮ Polynomial inference of universal automata from membership and equivalence queries ⋮ Automatic learning from positive data and negative counterexamples ⋮ Learning Conjunctive Grammars and Contextual Binary Feature Grammars

This page was built for publication: Towards General Algorithms for Grammatical Inference