Sciweavers

Share
STACS
2016
Springer

Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties

4 years 3 months ago
Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties
Cost register automata (CRA) and its subclass, copyless CRA, were recently proposed by Alur et al. as a new model for computing functions over strings. We study structural properties, expressiveness, and closure properties of copyless CRA. We show that copyless CRA are strictly less expressive than weighted automata and are not closed under reverse operation. To find a better class we impose restrictions on copyless CRA, which ends successfully with a new robust computational model that is closed under reverse and other extensions.
Filip Mazowiecki, Cristian Riveros
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where STACS
Authors Filip Mazowiecki, Cristian Riveros
Comments (0)
books