A hierarchy of deterministic context-free ω-languages

被引：26
|
作者：
Duparc, J
机构：
[1] CNRS, Equipe Log Math, URA 753, F-75251 Paris 05, France
[2] Univ Paris 07, UFR Math, F-75251 Paris, France
来源：
THEORETICAL COMPUTER SCIENCE | 2003年 / 290卷 / 03期
关键词：
deterministic context-free omega-languages; pushdown automata; Wadge hierarchy;
D O I：
10.1016/S0304-3975(02)00567-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Twenty years ago, Klaus. W. Wagner came up with a hierarchy of omega-regular sets that actually bears his name. It turned out to be exactly the Wadge hierarchy of the sets of 0)omega-words recognized by deterministic finite automata. We describe the Wadge hierarchy of context-free omega-languages, which stands as an extension of Wagner's work from automata to pushdown automata. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：1253 / 1300
页数：48
相关论文
共 50 条
12345