On the Computation of Some Standard Distances Between Probabilistic Automata

DOI10.1007/11812128_14zbMath1160.68406OpenAlexW1546312364MaRDI QIDQ5757213

Mehryar Mohri, Corinna Cortes, Ashish Rastogi

Publication date: 6 September 2007

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11812128_14

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Statistical aspects of information-theoretic topics (62B10)

Related Items (7)

Minimisation of Multiplicity Tree Automata ⋮ Computation of distances for regular and context-free probabilistic languages ⋮ Absolute convergence of rational series is semi-decidable ⋮ Regular Language Distance and Entropy ⋮ Absolute Convergence of Rational Series Is Semi-decidable ⋮ Definitions and properties of entropy and distance for regular languages ⋮ Undecidable Problems for Probabilistic Network Programming

This page was built for publication: On the Computation of Some Standard Distances Between Probabilistic Automata