Weighted Automata and Expressions over Pre-Rational Monoids - Archive ouverte HAL
Communication Dans Un Congrès Année : 2022

Weighted Automata and Expressions over Pre-Rational Monoids

Résumé

The Kleene theorem establishes a fundamental link between automata and expressions over the free monoid. Numerous generalisations of this result exist in the literature; on one hand, lifting this result to a weighted setting has been widely studied. On the other hand, beyond the free monoid, different monoids can be considered: for instance, two-way automata, and even tree-walking automata, can be described by expressions using the free inverse monoid. In the present work, we aim at combining both research directions and consider weighted extensions of automata and expressions over a class of monoids that we call pre-rational, generalising both the free inverse monoid and graded monoids. The presence of idempotent elements in these pre-rational monoids leads in the weighted setting to consider infinite sums. To handle such sums, we will have to restrict ourselves to rationally additive semirings. Our main result is thus a generalisation of the Kleene theorem for pre-rational monoids and rationally additive semirings. As a corollary, we obtain a class of expressions equivalent to weighted two-way automata, as well as one for tree-walking automata.
Fichier principal
Vignette du fichier
LIPIcs-CSL-2022-6.pdf (748.77 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-03545602 , version 1 (27-01-2022)

Licence

Identifiants

Citer

Nicolas Baudru, Louis-Marie Dando, Nathan Lhote, Benjamin Monmege, Pierre-Alain Reynier, et al.. Weighted Automata and Expressions over Pre-Rational Monoids. 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), Feb 2022, Göttingen, France. ⟨10.4230/LIPIcs.CSL.2022.6⟩. ⟨hal-03545602⟩
83 Consultations
26 Téléchargements

Altmetric

Partager

More