The following pages link to Anna Kasprzik (Q388792):
Displaying 11 items.
- Four one-shot learners for regular tree languages and their polynomial characterizability (Q388793) (← links)
- Learning in the limit with lattice-structured hypothesis spaces (Q714848) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- Distributional Learning of Simple Context-Free Tree Grammars (Q3093967) (← links)
- A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness (Q3528412) (← links)
- String Extension Learning Using Lattices (Q3564879) (← links)
- Generalizing over Several Learning Settings (Q3588389) (← links)
- Two Equivalent Regularizations for Tree Adjoining Grammars (Q3618604) (← links)
- MAT Learning of Universal Automata (Q4910453) (← links)
- (Q4964028) (← links)
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (Q5199996) (← links)
