Weak cost register automata are still powerful

DOI10.1007/978-3-319-98654-8_7MaRDI QIDQ1622948zbMATH OpenOpenAlexFDO

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

Publication date 22 November 2018

Full work available at URL https://arxiv.org/abs/1804.06336

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Abstract: We consider one of the weakest variants of cost register automata over a tropical semiring, namely copyless cost register automata over $mathbbN$ 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, 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.

Recommendations

• Weak cost register automata are still powerful
• Better complexity bounds for cost register automata
• Better complexity bounds for cost register automata
• Copyless cost-register automata: structure, expressiveness, and closure properties
• Copyless cost-register automata: structure, expressiveness, and closure properties

Cited in

(14)

• Copyless cost-register automata: structure, expressiveness, and closure properties
• Better complexity bounds for cost register automata
• What's decidable about weighted automata?
• A robust class of linear recurrence sequences
• Copyless cost-register automata: structure, expressiveness, and closure properties
• A generalised twinning property for minimisation of cost register automata
• Determinisation of finitely-ambiguous copyless cost register automata
• Better complexity bounds for cost register automata
• scientific article; zbMATH DE number 7407779 (Why is no real title available?)
• Regular functions and cost register automata (invited paper)
• Decision problems for additive regular functions
• Maximal partition logic: towards a logical characterization of copyless cost register automata
• Weak cost register automata are still powerful
• Optimal run problem for weighted register automata

This page was built for publication: Weak cost register automata are still powerful

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1622948)