COMPUTATION TREE LOGIC AND REGULAR OMEGA-LANGUAGES

被引：12
|
作者：
THOMAS, W
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1989年 / 354卷
关键词：
D O I：
10.1007/BFb0013041
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：690 / 713
页数：24
相关论文
共 50 条
  • [41] Logic vs Topology on Regular ω-languages
    Orekhovskii, Vladislav
    Selivanov, Victor
    UNITY OF LOGIC AND COMPUTATION, CIE 2023, 2023, 13967 : 141 - 153
  • [42] On topological completeness of regular tree languages
    Michalewski, H. (H.Michalewski@mimuw.edu.pl), 1600, Springer Verlag (7230 LNCS):
  • [43] Regular tree languages and quasi orders
    Petkovic, Tatjana
    ACTA CYBERNETICA, 2006, 17 (04): : 811 - 823
  • [44] Regular tree languages definable in FO
    Benedikt, M
    Segoufin, L
    STACS 2005, PROCEEDINGS, 2005, 3404 : 327 - 339
  • [45] Algebraic classifications of regular tree languages
    Steinby, M
    STRUCTURAL THEORY OF AUTOMATA, SEMIGROUPS, AND UNIVERSAL ALGEBRA, 2005, 207 : 381 - 432
  • [46] Stochastic Inference of Regular Tree Languages
    Rafael C. Carrasco
    Jose Oncina
    Jorge Calera-Rubio
    Machine Learning, 2001, 44 : 185 - 197
  • [47] Regular tree languages and rewrite systems
    Fundam Inf, 1-2 (157):
  • [48] Alignment distance of regular tree languages
    Han, Yo-Sub
    Ko, Sang-Ki
    THEORETICAL COMPUTER SCIENCE, 2019, 787 : 127 - 137
  • [49] Property testing of regular tree languages
    Magniez, F
    de Rougemont, M
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 932 - 944
  • [50] Algebraic recognizability of regular tree languages
    Ésik, Z
    Weil, P
    THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) : 291 - 321
12345