Automata and Logics for Words and Trees over an Infinite Alphabet
Automata and Logics for Words and Trees over an Infinite Alphabet
复制标题
DOI：
10.1007/11874683_3
复制
发表时间：
2006-09
期刊：
影响因子：
--
通讯作者：
L. Segoufin
中科院分区：
文献类型：
--
作者：
L. Segoufin
在字典或字典树中，每个位置都带有一个来自有限字母表的标签和一个来自无限域的数据值。这些模型已经被认为是在半结构化数据，时间自动机和扩展时态逻辑领域。本文综述了几个已知的结果，自动机和逻辑操纵数据字和数据树，重点是他们的相对表达能力和可判定性。
In adata wordor adata treeeach 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.