@article{Tzeng:SIAMJC:1992,
    Address = {Philadelphia, PA, USA},
    Author = {Tzeng, Wen-Guey},
    File = {A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata - a - a - a - z.pdf},
    ISSN = {0097-5397},
    Journal = {SIAM J. Comput.},
    Keywords = {approximate equivalence, equivalence, nondeterministic finite automata, path equivalence, probabilistic automata, unambiguous finite automata},
    Month = {April},
    Number = {2},
    Pages = {216--227},
    Publisher = {Society for Industrial and Applied Mathematics},
    Title = {A Polynomial-time Algorithm for the Equivalence of Probabilistic Automata},
    URL = {http://dx.doi.org/10.1137/0221017},
    Volume = {21},
    Year = {1992},
    acmid = {130206},
    bdsk-url-1 = {http://dx.doi.org/10.1137/0221017},
    date-added = {2018-06-12 17:02:11 +0000},
    date-modified = {2020-10-05 09:15:27 +0200},
    issue_date = {April 1992},
    numpages = {12},
    doi = {10.1137/0221017}
}

@article{Tzeng:SIAMJC:1992, Address = {Philadelphia, PA, USA}, Author = {Tzeng, Wen-Guey}, File = {A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata - a - a - a - z.pdf}, ISSN = {0097-5397}, Journal = {SIAM J. Comput.}, Keywords = {approximate equivalence, equivalence, nondeterministic finite automata, path equivalence, probabilistic automata, unambiguous finite automata}, Month = {April}, Number = {2}, Pages = {216--227}, Publisher = {Society for Industrial and Applied Mathematics}, Title = {A Polynomial-time Algorithm for the Equivalence of Probabilistic Automata}, URL = {http://dx.doi.org/10.1137/0221017}, Volume = {21}, Year = {1992}, acmid = {130206}, bdsk-url-1 = {http://dx.doi.org/10.1137/0221017}, date-added = {2018-06-12 17:02:11 +0000}, date-modified = {2020-10-05 09:15:27 +0200}, issue_date = {April 1992}, numpages = {12}, doi = {10.1137/0221017} }

Library Size: 13G (12942 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A badge