L p distance and equivalence of probabilistic automata

Corinna Cortes, Mehryar Mohri, Ashish Rastogi

Research output: Contribution to journalArticle

Abstract

This paper presents an exhaustive analysis of the problem of computing the L p distance of two probabilistic automata. It gives efficient exact and approximate algorithms for computing these distances for p even and proves the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results. It further proves the hardness of approximating the L p distance of two probabilistic automata for odd values of p. Similar techniques to those used for computing the L p distance also yield efficient algorithms for computing the Hellinger distance of two unambiguous probabilistic automata both exactly and approximately. A problem closely related to the computation of a distance between probabilistic automata is that of testing their equivalence. This paper also describes an efficient algorithm for testing the equivalence of two arbitrary probabilistic automata A 1 and A 2 in time O(|Σ| (|A 1| + |A 2|) 3), a significant improvement over the previously best reported algorithm for this problem.

Original languageEnglish (US)
Pages (from-to)761-779
Number of pages19
JournalInternational Journal of Foundations of Computer Science
Volume18
Issue number4
DOIs
StatePublished - Aug 2007

Fingerprint

Hardness
Testing

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

L p distance and equivalence of probabilistic automata. / Cortes, Corinna; Mohri, Mehryar; Rastogi, Ashish.

In: International Journal of Foundations of Computer Science, Vol. 18, No. 4, 08.2007, p. 761-779.

Research output: Contribution to journalArticle

@article{c7dee8bc39004b2c87b618c0f3769e9b,
title = "L p distance and equivalence of probabilistic automata",
abstract = "This paper presents an exhaustive analysis of the problem of computing the L p distance of two probabilistic automata. It gives efficient exact and approximate algorithms for computing these distances for p even and proves the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results. It further proves the hardness of approximating the L p distance of two probabilistic automata for odd values of p. Similar techniques to those used for computing the L p distance also yield efficient algorithms for computing the Hellinger distance of two unambiguous probabilistic automata both exactly and approximately. A problem closely related to the computation of a distance between probabilistic automata is that of testing their equivalence. This paper also describes an efficient algorithm for testing the equivalence of two arbitrary probabilistic automata A 1 and A 2 in time O(|Σ| (|A 1| + |A 2|) 3), a significant improvement over the previously best reported algorithm for this problem.",
author = "Corinna Cortes and Mehryar Mohri and Ashish Rastogi",
year = "2007",
month = "8",
doi = "10.1142/S0129054107004966",
language = "English (US)",
volume = "18",
pages = "761--779",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - L p distance and equivalence of probabilistic automata

AU - Cortes, Corinna

AU - Mohri, Mehryar

AU - Rastogi, Ashish

PY - 2007/8

Y1 - 2007/8

N2 - This paper presents an exhaustive analysis of the problem of computing the L p distance of two probabilistic automata. It gives efficient exact and approximate algorithms for computing these distances for p even and proves the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results. It further proves the hardness of approximating the L p distance of two probabilistic automata for odd values of p. Similar techniques to those used for computing the L p distance also yield efficient algorithms for computing the Hellinger distance of two unambiguous probabilistic automata both exactly and approximately. A problem closely related to the computation of a distance between probabilistic automata is that of testing their equivalence. This paper also describes an efficient algorithm for testing the equivalence of two arbitrary probabilistic automata A 1 and A 2 in time O(|Σ| (|A 1| + |A 2|) 3), a significant improvement over the previously best reported algorithm for this problem.

AB - This paper presents an exhaustive analysis of the problem of computing the L p distance of two probabilistic automata. It gives efficient exact and approximate algorithms for computing these distances for p even and proves the problem to be NP-hard for all odd values of p, thereby completing previously known hardness results. It further proves the hardness of approximating the L p distance of two probabilistic automata for odd values of p. Similar techniques to those used for computing the L p distance also yield efficient algorithms for computing the Hellinger distance of two unambiguous probabilistic automata both exactly and approximately. A problem closely related to the computation of a distance between probabilistic automata is that of testing their equivalence. This paper also describes an efficient algorithm for testing the equivalence of two arbitrary probabilistic automata A 1 and A 2 in time O(|Σ| (|A 1| + |A 2|) 3), a significant improvement over the previously best reported algorithm for this problem.

UR - http://www.scopus.com/inward/record.url?scp=34547532480&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547532480&partnerID=8YFLogxK

U2 - 10.1142/S0129054107004966

DO - 10.1142/S0129054107004966

M3 - Article

AN - SCOPUS:34547532480

VL - 18

SP - 761

EP - 779

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 4

ER -