| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437288 | Theoretical Computer Science | 2012 | 8 Pages |
Abstract
We solve a problem already investigated by Mohri in 1997: we show that the twins property for weighted finite automata over the tropical semiring is decidable and PSPACE-complete. We also point out that it is undecidable whether two given states are twins.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
