The inference of tree languages from finite samples: An algebraic approach
From MaRDI portal
Publication:1329735
DOI10.1016/0304-3975(94)90033-7zbMath0822.68055WikidataQ127720501 ScholiaQ127720501MaRDI QIDQ1329735
Publication date: 9 October 1995
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)90033-7
68Q45: Formal languages and automata
68T10: Pattern recognition, speech recognition
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
Computing the relative entropy between regular tree languages, LARS: a learning algorithm for rewriting systems, Learning Tree Languages, Learning tree languages from text
Cites Work
- Inference of tree automata from sample set of trees
- Derivatives of Tree Sets with Applications to Grammatical Inference
- Pattern Matching in Trees
- Inference of Reversible Languages
- A Note on the k-Tail Method of Tree Grammar Inference
- An algorithm for the inference of tree grammars
- On the Synthesis of Finite-State Machines from Samples of Their Behavior
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item