Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties
STACS, pp. 53:1-53:13, 2016.
Abstract 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 some structural properties, expressiveness, and closure properties of copyless CRA. We show that copyless CRA are strictly less expressive than weighted automata and ar...More
Full Text (Upload PDF)
PPT (Upload PPT)