Lp DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA

DOI10.1142/S0129054107004966zbMath1143.68432MaRDI QIDQ3503091

Mehryar Mohri, Corinna Cortes, Ashish Rastogi

Publication date: 20 May 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Learning probabilistic automata using residuals ⋮ Converging from branching to linear metrics on Markov chains ⋮ Generalization bounds for learning weighted automata ⋮ On Computing the Total Variation Distance of Hidden Markov Models. ⋮ Absolute convergence of rational series is semi-decidable ⋮ Absolute Convergence of Rational Series Is Semi-decidable ⋮ MAT learners for tree series: an abstract data type and two realizations ⋮ On the Rademacher Complexity of Weighted Automata

Cites Work

• The consensus string problem and the complexity of comparing hidden Markov models.
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Biological Sequence Analysis
• Some inequalities for information divergence and related measures of discrimination
• Probabilistic automata

This page was built for publication: L_p DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA