Automata and logics for words and trees over an infinite alphabet

被引：0
|
作者：
Segoufin, Luc [1 ]
机构：
[1] Univ Paris 11, Paris, France
来源：
COMPUTER SCIENCE LOGIC, PROCEEDINGS | 2006年 / 4207卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of semistructured data, timed automata and extended temporal logics. This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power and decidability.
引用
收藏
页码：41 / 57
页数：17
相关论文
共 50 条
  • [1] AN APPLICATION OF THE FEFERMAN-VAUGHT THEOREM TO AUTOMATA AND LOGICS FOR WORDS OVER AN INFINITE ALPHABET
    Bes, Alexis
    LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (01)
  • [2] Weighted automata and weighted logics on infinite words
    Droste, Manfred
    Rahonis, George
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 49 - 58
  • [3] Weighted Automata and Logics for Infinite Nested Words
    Droste, Manfred
    Dueck, Stefan
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 323 - 334
  • [4] Weighted automata and logics for infinite nested words
    Droste, Manfred
    Dueck, Stefan
    INFORMATION AND COMPUTATION, 2017, 253 : 448 - 466
  • [5] Weighted Automata and Weighted Logics on Infinite Words
    Droste, M.
    Rahonis, G.
    RUSSIAN MATHEMATICS, 2010, 54 (01) : 26 - 45
  • [6] 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,
  • [7] Jumping Automata over Infinite Words
    Almagor, Shaull
    Yizhaq, Omer
    THEORY OF COMPUTING SYSTEMS, 2024, 68 (06) : 1572 - 1600
  • [8] Jumping Automata over Infinite Words
    Almagor, Shaull
    Yizhaq, Omer
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2023, 2023, 13911 : 9 - 22
  • [9] Lambda Words: A Class of Rich Words Defined Over an Infinite Alphabet
    Carey, Norman
    JOURNAL OF INTEGER SEQUENCES, 2013, 16 (03)
  • [10] Quantum ω-Automata over Infinite Words and Their Relationships
    Amandeep Singh Bhatia
    Ajay Kumar
    International Journal of Theoretical Physics, 2019, 58 : 878 - 889
12345