Weighted automata map input words to numerical values. Applications of weighted
automata include formal verification of quantitative properties, as well as text, speech, and …

Weighted automata map input words to values, and have numerous applications in
computer science. A result by Krob from the 90s implies that the universality problem is …

We introduce a subclass of linear recurrence sequences which we call poly-rational
sequences because they are denoted by rational expressions closed under sum and …

We present pumping lemmas for five classes of functions definable by fragments of weighted
automata over the min-plus semiring, the max-plus semiring and the semiring of natural …

Cost register automata (CRA) are machines reading an input word while computing values
using write-only registers: values from registers are combined using the two operations, as …

Register automata (RA) are a computational model that can handle data values by adding
registers to finite automata. Recently, weighted register automata (WRA) were proposed by …