On the Computation of Some Standard Distances Between Probabilistic Automata
From MaRDI portal
Recommendations
- Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Computing probabilistic bisimilarity distances for probabilistic automata
- Efficient Computation of the Relative Entropy of Probabilistic Automata
- ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
Cited in
(13)- On the computational complexity of approximating distributions by probabilistic automata
- Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA
- ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
- Absolute Convergence of Rational Series Is Semi-decidable
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- scientific article; zbMATH DE number 7318983 (Why is no real title available?)
- scientific article; zbMATH DE number 7360012 (Why is no real title available?)
- Regular language distance and entropy
- Undecidable Problems for Probabilistic Network Programming
- Definitions and properties of entropy and distance for regular languages
- Structural, Syntactic, and Statistical Pattern Recognition
- Absolute convergence of rational series is semi-decidable
- Computation of distances for regular and context-free probabilistic languages
This page was built for publication: On the Computation of Some Standard Distances Between Probabilistic Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757213)