Back to Search
Start Over
Weak Cost Register Automata are Still Powerful.
- Source :
-
International Journal of Foundations of Computer Science . Sep2020, Vol. 31 Issue 6, p689-709. 21p. - Publication Year :
- 2020
-
Abstract
- We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over ℕ with updates using min and increments. We show that this model can simulate, in some sense, the runs of counter machines with zero-tests. We deduce that a number of problems pertaining to that model are undecidable, namely equivalence, upperboundedness, and semilinearity. In particular, the undecidability of equivalence disproves a conjecture of Alur et al. from 2012. To emphasize how weak these machines are, we also show that they can be expressed as a restricted form of linearly-ambiguous weighted automata. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 31
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 146967879
- Full Text :
- https://doi.org/10.1142/S0129054120410026