Computing the relative entropy between regular tree languages

DOI10.1016/S0020-0190(98)00172-0MaRDI QIDQ293468zbMATH OpenFDO

Authors Jorge Calera-Rubio, Rafael C. Carrasco

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098001720?np=y

zbMATH Keywords

automata theoryformal languagesinductive learning

Mathematics Subject Classification ID

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

Recommendations

• Accurate computation of the relative entropy between stochastic regular grammars
• Stochastic inference of regular tree languages
• scientific article; zbMATH DE number 2019605
• Learning Rational Stochastic Tree Languages
• A Spectral Approach for Probabilistic Grammatical Inference on Trees

Cites work

• scientific article; zbMATH DE number 3825216 (Why is no real title available?)
• scientific article; zbMATH DE number 3731374 (Why is no real title available?)
• scientific article; zbMATH DE number 54244 (Why is no real title available?)
• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• A measure of relative entropy between individual sequences with application to universal classification
• Accurate computation of the relative entropy between stochastic regular grammars
• Inference of Reversible Languages
• Learning context-free grammars from structural data in polynomial time
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Relative entropy between Markov transition rate matrices
• The inference of tree languages from finite samples: An algebraic approach
• The theory of languages

Cited in

(8)

• A similarity between probabilistic tree languages: Application to XML document families.
• Computation of distances for regular and context-free probabilistic languages
• scientific article; zbMATH DE number 4133518 (Why is no real title available?)
• CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS
• Stochastic inference of regular tree languages
• scientific article; zbMATH DE number 2019605 (Why is no real title available?)
• Cross-moments computation for stochastic context-free grammars
• LARS: a learning algorithm for rewriting systems

This page was built for publication: Computing the relative entropy between regular tree languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293468)