2 papers
cs.SC2010
The -Transform and Automata-Recognizable Systems of Nonhomogeneous Linear Recurrence Equations over Semirings
Edoardo Carta-Gerardino
A nonhomogeneous system of linear recurrence equations can be recognized by an automaton over a one-letter alphabet . Conversely, the automaton $\mathcal{A…
cs.FL2010
Weighted Automata and Recurrence Equations for Regular Languages
Edoardo Carta-Gerardino, Parisa Babaali
Let be the semiring of languages, and consider its subset . In this paper we define the language recognized by a weighted automaton over $\mathca…