Anna Kasprzik

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4964028	2021-02-24	Paper
Polynomial inference of universal automata from membership and equivalence queries	2015-12-28	Paper
Four one-shot learners for regular tree languages and their polynomial characterizability	2014-01-07	Paper
MAT Learning of Universal Automata	2013-03-18	Paper
Learning in the limit with lattice-structured hypothesis spaces	2012-10-11	Paper
Distributional Learning of Simple Context-Free Tree Grammars	2011-10-19	Paper
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data	2011-07-29	Paper
Generalizing over Several Learning Settings	2010-09-10	Paper
String Extension Learning Using Lattices	2010-05-26	Paper
Two Equivalent Regularizations for Tree Adjoining Grammars	2009-04-02	Paper
A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness	2008-10-16	Paper

This page was built for person: Anna Kasprzik