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.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00155280
Contributor : Alexis Bès <>
Submitted on : Sunday, June 17, 2007 - 8:53:57 AM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM
Document(s) archivé(s) le : Thursday, April 8, 2010 - 8:31:15 PM

Files

FefermanVaughtAutomata.pdf
Files produced by the author(s)

Identifiers

  • 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. 2007. ⟨hal-00155280⟩

Share

Metrics

Record views

147

Files downloads

105