Learning context-free grammars from positive data and membership queries

DOI10.1007/978-3-031-39784-4_1OpenAlexW4386208134MaRDI QIDQ6199573

Makoto Kanazawa

Publication date: 28 February 2024

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-39784-4_1

zbMATH Keywords

context-free grammarsgrammatical inferencemembership queriesextended regular closure

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Learning regular sets from queries and counterexamples
• Learning Context Free Grammars with the Finite Context Property: A Correction of A. Clark’s Algorithm
• Gold-Style Learning Theory
• Efficiency in the Identification in the Limit Learning Paradigm
• A note on the number of queries needed to identify regular languages
• Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices
• The Strong, Weak, and Very Weak Finite Context and Kernel Properties

This page was built for publication: Learning context-free grammars from positive data and membership queries