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 条
12345