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

Abstract : 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.
Type de document :
Pré-publication, Document de travail
Rapport interne LACL 2007-06. 2007
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00155280
Contributeur : Alexis Bès <>
Soumis le : dimanche 17 juin 2007 - 08:53:57
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28
Document(s) archivé(s) le : jeudi 8 avril 2010 - 20:31:15

Fichiers

FefermanVaughtAutomata.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00155280, version 1

Collections

Citation

Alexis Bès. An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet. Rapport interne LACL 2007-06. 2007. 〈hal-00155280〉

Partager

Métriques

Consultations de la notice

144

Téléchargements de fichiers

89