A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 1992 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Computing, volume 21, pages 216-227 (issn: 0097-5397, eissn: 1095-7111,

Copyright policy )

Authors: Wen-Guey Tzeng;

doi: 10.1137/0221017

A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata

- Summary
- Subjects
- Metrics

Abstract

The author gives an \(O((n_ 1+n_ 2)^ 4)\) algorithm for determining whether two probabilistic automata with \(n_ 1\), respectively \(n_ 2\) states, are equivalent. The author studies the path equivalence problem for nondeterministic automata without \(\lambda\)-transitions and also the approximate equivalence problem for probabilistic automata.

Keywords

Analysis of algorithms and problem complexity, approximate equivalence, Formal languages and automata, unambiguous finite automata, path equivalence, nondeterministic finite automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	81
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average