Weak cost register automata are still powerful
We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over N with updates using min and increments. We show that this model can simulate, in some sense, counter machines with zero-tests.We deduce that a number of problems p...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
Springer
2018
|