Computer Science – Logic in Computer Science
Scientific paper
2008-01-16
LMCS 4 (1:8) 2008
Computer Science
Logic in Computer Science
24 pages
Scientific paper
10.2168/LMCS-4(1:8)2008
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.
No associations
LandOfFree
An Application of the Feferman-Vaught Theorem to Automata and Logics for<br> Words over an Infinite Alphabet does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Application of the Feferman-Vaught Theorem to Automata and Logics for<br> Words over an Infinite Alphabet, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Application of the Feferman-Vaught Theorem to Automata and Logics for<br> Words over an Infinite Alphabet will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159915