LIPIcs.CONCUR.2015.142.pdf
- Filesize: 456 kB
- 13 pages
We consider weighted automata with both positive and negative integer weights on edges and study the problem of synchronization using adaptive strategies that may only observe whether the current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata.
Feedback for Dagstuhl Publishing