On the computational complexity of infinite words

被引：0
|
作者：
Duris, P
Manuch, J
机构：
[1] Univ Turku, Turku Ctr Comp Sci, Turku, Finland
[2] Univ Turku, Dept Math, Turku, Finland
[3] Rhein Westfal TH Aachen, Dep Comp Sci 1, Aachen, Germany
来源：
THEORETICAL COMPUTER SCIENCE | 2003年 / 295卷 / 1-3期
关键词：
infinite words; computational complexity; dgsm; double and triple D0L TAG systems;
D O I：
10.1016/S0304-3975(02)00400-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper contains answers to several problems in the theory of the computational complexity of infinite words. We show that the problem whether all infinite words generated by iterating deterministic generalized sequential machines have logarithmic space complexity is equivalent to the open problem asking whether the unary classes of languages in P and in DLOG are equivalent. Similarly, the problem to find a concrete infinite word which cannot be generated in logarithmic space is equivalent to the problem to find a concrete language which does not belong to DSPACE(n). Finally, we separate classes of infinite words generated by double and triple DOL TAG systems. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：141 / 151
页数：11
相关论文
共 50 条
12345