An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet

Résumé

We show that a special case of the Feferman-Vaught composition theorem gives rise to a natural notion of automata for finite words over an infinite alphabet, with good closure and decidability properties, as well as several logical characterizations. We also consider a slight extension of the Feferman-Vaught formalism which allows to express more relations between component values (such as equality), and prove related decidability results. From this result we get an interesting class of decidable logics for words over an infinite alphabet.
Fichier principal
Vignette du fichier
FefermanVaughtAutomata.pdf (231.24 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00155280 , version 1 (17-06-2007)

Identifiants

  • HAL Id : hal-00155280 , version 1

Citer

Alexis Bès. An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. 2007. ⟨hal-00155280⟩
74 Consultations
166 Téléchargements

Partager

Gmail Facebook X LinkedIn More