Inference of tree automata from sample set of trees

DOI10.1007/BF00979871zbMath0566.68064OpenAlexW1975542793MaRDI QIDQ3681956

No author found.

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00979871

zbMATH Keywords

tree automatoninference of automatak-follower of a treesample tree

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Related Items (4)

The inference of tree languages from finite samples: An algebraic approach ⋮ Learning tree languages from positive examples and membership queries ⋮ Learning tree languages from text ⋮ Learning Tree Languages

Cites Work

• Derivatives of Tree Sets with Applications to Grammatical Inference
• Grammatical Inference: Introduction and Survey - Part I
• Grammatical Inference: Introduction and Survey - Part II
• A Note on the k-Tail Method of Tree Grammar Inference
• An algorithm for the inference of tree grammars
• The minimalization of tree automata
• Derivatives of Regular Expressions
• On the Synthesis of Finite-State Machines from Samples of Their Behavior

This page was built for publication: Inference of tree automata from sample set of trees