Computing the relative entropy between regular tree languages

DOI10.1016/S0020-0190(98)00172-0zbMath1339.68143MaRDI QIDQ293468

Rafael C. Carrasco, Jorge Calera-Rubio

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

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

Related Items (5)

LARS: a learning algorithm for rewriting systems ⋮ A similarity between probabilistic tree languages: Application to XML document families. ⋮ Computation of distances for regular and context-free probabilistic languages ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS ⋮ CROSS-MOMENTS COMPUTATION FOR STOCHASTIC CONTEXT-FREE GRAMMARS

Cites Work

• Learning context-free grammars from structural data in polynomial time
• The inference of tree languages from finite samples: An algebraic approach
• Inference of Reversible Languages
• Learning deterministic regular grammars from stochastic samples in polynomial time
• Relative entropy between Markov transition rate matrices
• A measure of relative entropy between individual sequences with application to universal classification
• Accurate computation of the relative entropy between stochastic regular grammars
• The theory of languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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