Weak cost register automata are still powerful

DOI10.1007/978-3-319-98654-8_7zbMath1458.68079arXiv1804.06336OpenAlexW2963588373MaRDI QIDQ1622948

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

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)

Related Items (5)

Unnamed Item ⋮ Optimal run problem for weighted register automata ⋮ What's decidable about weighted automata? ⋮ Unnamed Item ⋮ A robust class of linear recurrence sequences

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