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

by Alexis Bès

Released as a article .

2008  

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 new classes of decidable logics for words over an infinite alphabet.
In text/plain format

Archived Files and Locations

application/pdf  305.3 kB
file_pdjc33qfoffttocgiaoftcz62e
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  310.2 kB
file_xovabj3xjbd4pefbyir2ogc4qe
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2008-03-25
Version   v2
Language   en ?
arXiv  0801.2498v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: c84b1e69-1c31-4022-8ef8-3015cc38ae19
API URL: JSON