Accurate computation of the relative entropy between stochastic regular grammars

DOI10.1051/ITA/1997310504371zbMATH Open0893.68094OpenAlexW138349765MaRDI QIDQ4385674FDOQ4385674

Authors: Rafael C. Carrasco 

Publication date: 20 April 1998

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92571

Recommendations

• Computing the relative entropy between regular tree languages
• Efficient Computation of the Relative Entropy of Probabilistic Automata
• Stochastic inference of regular tree languages
• ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
• Inference of Finite-State Probabilistic Grammars

zbMATH Keywords

grammatical inferencestochastic grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the inference of stochastic regular grammars

Cited In (7)

• A similarity between probabilistic tree languages: Application to XML document families.
• Discovering stochastic process models by reduction and abstraction
• Computation of distances for regular and context-free probabilistic languages
• Title not available (Why is that?)
• Computing the relative entropy between regular tree languages
• ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
• Efficient Computation of the Relative Entropy of Probabilistic Automata

This page was built for publication: Accurate computation of the relative entropy between stochastic regular grammars

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