AN APPLICATION OF THE FEFERMAN-VAUGHT THEOREM TO AUTOMATA AND LOGICS FOR WORDS OVER AN INFINITE ALPHABET

被引：8

作者：

Bes, Alexis ^{[1
]}

机构：

[1] Univ Paris Est, Lab Algorithm Complex & Log, EA 4213, Paris, France

来源：

LOGICAL METHODS IN COMPUTER SCIENCE | 2008年 / 4卷 / 01期

关键词：

Feferman-Vaught method; composition theorems; decidability; automata; infinite alphabet;

D O I：

10.2168/LMCS-4(1:8)2008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页数：23

共 26 条

[21] Variations on the Feferman-Vaught theorem, with applications to ∏pFp\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\prod _p \mathbb {F}_p$$\end{document}Variations on the Feferman-Vaught theorem, with...A. Medvedev, A. Van Abel
Alice Medvedev
Alexander Van Abel
Archive for Mathematical Logic, 2025, 64 (3) : 529 - 546
[22] Incompleteness Theorems, Large Cardinals, and Automata over Infinite Words
Finkel, Olivier
AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 222 - 233
[23] Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability
Baier, Christel
Bertrand, Nathalie
Groesser, Marcus
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2009, (03): : 3 - 16
[24] Two-Way Cost Automata and Cost Logics over Infinite Trees
Blumensath, Achim
Colcombet, Thomas
Kuperberg, Denis
Parys, Pawel
Vanden Boom, Michael
PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
[25] Deciding FO2 Alternation for Automata over Finite and Infinite Words
Henriksson, Viktor
Kufleitner, Manfred
DEVELOPMENTS IN LANGUAGE THEORY, DLT 2021, 2021, 12811 : 180 - 191
[26] Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Choffrut, Christian
Grigorieff, Serge
THEORETICAL COMPUTER SCIENCE, 2009, 410 (01) : 16 - 34

← 1 2 3 →