Weighted Automata and Recurrence Equations for Regular Languages

Edoardo Carta-Gerardino, Parisa Babaali

Let $\mathcal{P}({\Sigma }^{\ast })$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma )$. In this paper we define the language recognized by a weighted automaton over $\mathca…