Stochastic inference of regular tree languages
From MaRDI portal
Publication:5945687
DOI10.1023/A:1010836331703zbMath0983.68106MaRDI QIDQ5945687
Rafael C. Carrasco, Jose Oncina, Jorge Calera-Rubio
Publication date: 14 October 2001
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010836331703
68Q45: Formal languages and automata
Related Items
\textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition, Grammatical inference of directed acyclic graph languages with polynomial time complexity, Learning grammars for architecture-specific facade parsing, Learning tree languages from positive examples and membership queries, LARS: a learning algorithm for rewriting systems, Smoothing and compression with stochastic \(k\)-testable tree languages, Learning tree languages from text, Learning Rational Stochastic Tree Languages