Efficient Computation of the Relative Entropy of Probabilistic Automata

DOI10.1007/11682462_32zbMath1145.68459OpenAlexW1607576897MaRDI QIDQ3525770

Michael D. Riley, Mehryar Mohri, Corinna Cortes, Ashish Rastogi

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Measures of information, entropy (94A17)

Related Items (4)

Computation of distances for regular and context-free probabilistic languages ⋮ On the existence of regular approximations ⋮ Regular Language Distance and Entropy ⋮ Diagnosis and Automata

This page was built for publication: Efficient Computation of the Relative Entropy of Probabilistic Automata