Two-Way Representations and Weighted Automata
Résumé
We study the series realized by weighted two-way automata, that are strictly more powerful than weighted one-way automata. To this end, we consider the Hadamard product and the Hadamard iteration of formal power series. We introduce the representation of two-way automata and show that the series they realize can be interpreted as the solution of fixed-point equations. In rationally additive semirings, we prove that two-way automata are equivalent to two-way representations, and, for some specific classes of two-way automata, rotating and sweeping automata, we give a characterization of the series that can be realized.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...