A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
Logical Methods in Computer Science
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.doi:10.2168/lmcs-4(1:8)2008 fatcat:z66ni77bqjf4xirnjz5emq36qe