Index sets for ω-languages

被引：3
|
作者：
Czenzer, D
Remmel, JB
机构：
[1] Univ Florida, Dept Math, Gainesville, FL 32611 USA
[2] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA
来源：
MATHEMATICAL LOGIC QUARTERLY | 2003年 / 49卷 / 01期
关键词：
omega-language; index set; computable analysis;
D O I：
10.1002/malq.200310002
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An omega-language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of automata or Turing machine. Certain families of languages, such as the Sigma(2)(0) languages, may enumerated as P-0, P-1,.... and then an index set associated to a given property R (such as finiteness) of languages is just the set of e such that P-e has the property. The complexity of index sets for 7 types of languages is determined for various properties related to the size of the language.
引用
收藏
页码：22 / 33
页数：12
相关论文
共 50 条
  • [31] ON DEGREES OF INDEX SETS
    YATES, CEM
    JOURNAL OF SYMBOLIC LOGIC, 1966, 31 (01) : 155 - &
  • [32] INDEX SETS UNIVERSAL FOR DIFFERENCES OF ARITHMETIC SETS
    HAY, L
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1974, 20 (03): : 239 - 254
  • [33] On Friendly Index Sets and Product-Cordial Index Sets of Gear Graphs
    Lau, Gee-Choon
    Lee, Sin-Min
    Ng, Ho-Kuen
    PROCEEDINGS OF THE 21ST NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES (SKSM21): GERMINATION OF MATHEMATICAL SCIENCES EDUCATION AND RESEARCH TOWARDS GLOBAL SUSTAINABILITY, 2014, 1605 : 649 - 654
  • [34] 2 ω-finite automata and sets of obstructions of their languages
    Melnikov, B.F.
    Journal of Applied Mathematics and Computing, 1999, 6 (03): : 565 - 574
  • [35] Positive Characteristic Sets for Relational Pattern Languages
    Mousawi, S. Mahmoud
    Zilles, Sandra
    SOFSEM 2024: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2024, 14519 : 398 - 412
  • [36] 2 ω-finite automata and sets of obstructions of their languages
    B. F. Melnikov
    Korean Journal of Computational & Applied Mathematics, 1999, 6 (3) : 565 - 574
  • [37] Semantic representations and query languages for Or-sets
    Libkin, L
    Wong, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1996, 52 (01) : 125 - 142
  • [38] Unavoidable languages: cuts and innocent sets of words
    Univ. Paris-VII, lab. informatique, theorique programmation, 75251 Paris, France
    RAIRO Inf Theor Appl Theor Inf Appl, 5 (339-382):
  • [39] Polynomial size test sets for commutative languages
    Hakala, I
    Kortelainen, J
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1997, 31 (03): : 291 - 304
  • [40] On a hierarchy of slender languages based on control sets
    Fujitsu Lab Ltd, Kanagawa, Japan
    Fundam Inf, 1 (41-47):
12345