Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data

DOI10.1007/978-3-642-22321-1_45zbMath1221.68107OpenAlexW88926580MaRDI QIDQ5199996

Anna Kasprzik

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22321-1_45

Mathematics Subject Classification ID

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

Related Items (2)

Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Unnamed Item

This page was built for publication: Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data