Weak Cost Register Automata Are Still Powerful

Shaull Almagor; Michaël Cadilhac; Filip Mazowiecki; Guillermo A. Pérez

doi:https://doi.org/10.1007/978-3-319-98654-8_7

Weak Cost Register Automata Are Still Powerful

Shaull Almagor, Michaël Cadilhac, Filip Mazowiecki, Guillermo A. Pérez

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 N 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, in particular equivalence, disproving 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.

Original language	English
Title of host publication	Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings
Editors	Mizuho Hoshi, Shinnosuke Seki
Pages	83-95
Number of pages	13
DOIs	https://doi.org/10.1007/978-3-319-98654-8_7
State	Published - 2018
Externally published	Yes
Event	22nd International Conference on Developments in Language Theory, DLT 2018 - Tokyo, Japan Duration: 10 Sep 2018 → 14 Sep 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11088 LNCS

Conference

Conference	22nd International Conference on Developments in Language Theory, DLT 2018
Country/Territory	Japan
City	Tokyo
Period	10/09/18 → 14/09/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

https://doi.org/10.1007/978-3-319-98654-8_7

Cite this

Almagor, S., Cadilhac, M., Mazowiecki, F., & Pérez, G. A. (2018). Weak Cost Register Automata Are Still Powerful. In M. Hoshi, & S. Seki (Eds.), Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings (pp. 83-95). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11088 LNCS). https://doi.org/10.1007/978-3-319-98654-8_7

Almagor, Shaull ; Cadilhac, Michaël ; Mazowiecki, Filip et al. / Weak Cost Register Automata Are Still Powerful. Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. editor / Mizuho Hoshi ; Shinnosuke Seki. 2018. pp. 83-95 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5f8763fd308a4bce803f31fcae1a872e,

title = "Weak Cost Register Automata Are Still Powerful",

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 N 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, in particular equivalence, disproving 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.",

author = "Shaull Almagor and Micha{\"e}l Cadilhac and Filip Mazowiecki and P{\'e}rez, {Guillermo A.}",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 22nd International Conference on Developments in Language Theory, DLT 2018 ; Conference date: 10-09-2018 Through 14-09-2018",

year = "2018",

doi = "https://doi.org/10.1007/978-3-319-98654-8_7",

language = "الإنجليزيّة",

isbn = "9783319986531",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "83--95",

editor = "Mizuho Hoshi and Shinnosuke Seki",

booktitle = "Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings",

}

Almagor, S, Cadilhac, M, Mazowiecki, F & Pérez, GA 2018, Weak Cost Register Automata Are Still Powerful. in M Hoshi & S Seki (eds), Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11088 LNCS, pp. 83-95, 22nd International Conference on Developments in Language Theory, DLT 2018, Tokyo, Japan, 10/09/18. https://doi.org/10.1007/978-3-319-98654-8_7

Weak Cost Register Automata Are Still Powerful. / Almagor, Shaull; Cadilhac, Michaël; Mazowiecki, Filip et al.
Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. ed. / Mizuho Hoshi; Shinnosuke Seki. 2018. p. 83-95 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11088 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Weak Cost Register Automata Are Still Powerful

AU - Almagor, Shaull

AU - Cadilhac, Michaël

AU - Mazowiecki, Filip

AU - Pérez, Guillermo A.

PY - 2018

Y1 - 2018

N2 - We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over with updates using N 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, in particular equivalence, disproving 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.

AB - We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over with updates using N 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, in particular equivalence, disproving 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.

UR - http://www.scopus.com/inward/record.url?scp=85053876457&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/978-3-319-98654-8_7

DO - https://doi.org/10.1007/978-3-319-98654-8_7

M3 - منشور من مؤتمر

SN - 9783319986531

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 83

EP - 95

BT - Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings

A2 - Hoshi, Mizuho

A2 - Seki, Shinnosuke

T2 - 22nd International Conference on Developments in Language Theory, DLT 2018

Y2 - 10 September 2018 through 14 September 2018

ER -

Almagor S, Cadilhac M, Mazowiecki F, Pérez GA. Weak Cost Register Automata Are Still Powerful. In Hoshi M, Seki S, editors, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. 2018. p. 83-95. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: https://doi.org/10.1007/978-3-319-98654-8_7

Weak Cost Register Automata Are Still Powerful

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this