Inference of tree automata from sample set of trees
From MaRDI portal
Recommendations
- The inference of tree languages from finite samples: An algebraic approach
- Query learning of regular tree languages: How to avoid dead states
- Four one-shot learners for regular tree languages and their polynomial characterizability
- Learning Multiplicity Tree Automata
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
Cites work
- A Note on the k-Tail Method of Tree Grammar Inference
- An algorithm for the inference of tree grammars
- Derivatives of Regular Expressions
- Derivatives of Tree Sets with Applications to Grammatical Inference
- Grammatical Inference: Introduction and Survey - Part I
- Grammatical Inference: Introduction and Survey - Part II
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- The minimalization of tree automata
Cited in
(7)- The inference of tree languages from finite samples: An algebraic approach
- Learning tree languages from positive examples and membership queries
- Learning Tree Languages
- Learning tree languages from text
- scientific article; zbMATH DE number 3980528 (Why is no real title available?)
- scientific article; zbMATH DE number 4062640 (Why is no real title available?)
- Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
This page was built for publication: Inference of tree automata from sample set of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681956)
