Query learning of regular tree languages: How to avoid dead states

DOI10.1007/s00224-005-1233-3zbMath1107.68049OpenAlexW2152514455MaRDI QIDQ866917

Frank Drewes, Johanna Högberg

Publication date: 14 February 2007

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-005-1233-3

zbMATH Keywords

inference algorithm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (10)

Learning of Structurally Unambiguous Probabilistic Grammars ⋮ On the regularity and learnability of ordered DAG languages ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ A survey of model learning techniques for recurrent neural networks ⋮ Unnamed Item ⋮ Learning tree languages from text ⋮ Learning Tree Languages ⋮ Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries ⋮ Learning pomset automata ⋮ MAT learners for tree series: an abstract data type and two realizations

This page was built for publication: Query learning of regular tree languages: How to avoid dead states