A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness

DOI10.1007/978-3-540-88009-7_9zbMath1177.68117OpenAlexW1871112346MaRDI QIDQ3528412

Anna Kasprzik

Publication date: 16 October 2008

Published in: Grammatical Inference: Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88009-7_9

zbMATH Keywords

MAT learningmulti-dimensional treesfinite-state

Mathematics Subject Classification ID

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

Related Items (3)

Efficient learning of multiple context-free languages with multidimensional substitutability from positive data ⋮ Two Equivalent Regularizations for Tree Adjoining Grammars ⋮ Learning Mildly Context-Sensitive Languages with Multidimensional Substitutability from Positive Data

This page was built for publication: A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness