Pebble Weighted Automata and Weighted Logics - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Computational Logic Année : 2014

Pebble Weighted Automata and Weighted Logics

Résumé

We introduce new classes of weighted automata on words. Equipped with pebbles, they go beyond the class of recognizable formal power series: they capture weighted first-order logic enriched with a quantitative version of transitive closure. In contrast to previous work, this calculus allows for unrestricted use of existential and universal quantifications over positions of the input word. We actually consider both two-way and one-way pebble weighted automata. The latter class constrains the head of the automaton to walk left-to-right, resetting it each time a pebble is dropped. Such automata have already been considered in the Boolean setting, in the context of data words. Our main result states that two-way pebble weighted automata, one- way pebble weighted automata, and our weighted logic are expressively equivalent. We also give new logical characterizations of standard recognizable series.
Fichier principal
Vignette du fichier
journal.pdf (503.86 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00964994 , version 1 (24-03-2014)
hal-00964994 , version 2 (12-06-2014)

Identifiants

Citer

Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Pebble Weighted Automata and Weighted Logics. ACM Transactions on Computational Logic, 2014, 15 (2), pp.15. ⟨10.1145/2579819⟩. ⟨hal-00964994v2⟩
180 Consultations
228 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More