关于无限秩 Borel 集的 Omega 上下文无关语言
计算机科学中的逻辑
2010-06-02 v1 逻辑
摘要
本文是对 omega 上下文无关语言 (omega-CFL) 拓扑性质研究的延续。我们之前证明了 omega-CFL 类穷尽了有限秩 Borel 集的层次结构，并且存在一些解析但非 Borel 集的 omega-CFL。本文证明存在一些 omega 上下文无关语言是无限（但非有限）秩的 Borel 集，从而对 Lescow 和 Thomas [Logical Specifications of Infinite Computations, In:"A Decade of Concurrency", Springer LNCS 803 (1994), 583-621] 的问题给出了额外回答。
关键词
引用
@article{arxiv.1005.5633,
title = {On Omega Context Free Languages which are Borel Sets of Infinite Rank},
author = {Olivier Finkel},
journal= {arXiv preprint arXiv:1005.5633},
year = {2010}
}
备注
The supremum of the set of Borel ranks of omega-context-free languages is actually greater than the first non-recursive ordinal. This has been proved later in a paper "Borel Ranks and Wadge Degrees of Omega Context Free Languages" published in the journal Mathematical Structures in Computer Science (2006)