Pebble weighted automata and transitive closure logics - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Pebble weighted automata and transitive closure logics

Résumé

We introduce new classes of weighted automata on words. Equipped with pebbles and a two-way mechanism, they go beyond the class of recognizable formal power series, but capture a weighted version of first-order logic with bounded transitive closure. In contrast to previous work, this logic allows for unrestricted use of universal quantification. Our main result states that pebble weighted automata, nested weighted automata, and this weighted logic are expressively equivalent. We also give new logical characterizations of the recognizable series.
Fichier principal
Vignette du fichier
BolligGastinMonmegeZeitoun_-_10_-_Pebble_Weighted_Automata_and_Transitive_Closure_Logics0.pdf (226.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00608179 , version 1 (12-07-2011)

Identifiants

Citer

Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Pebble weighted automata and transitive closure logics. Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) - Part II, Jul 2010, Bordeaux, France. pp.587-598, ⟨10.1007/978-3-642-14162-1_49⟩. ⟨hal-00608179⟩
204 Consultations
187 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More