Systolic tree ω-languages:: the operational and the logical view

被引：3
|
作者：
Monti, A
Peron, A
机构：
[1] Univ Udine, Dipartimento Matemat & Informat, I-33100 Udine, Italy
[2] Univ Rome La Sapienza, Dipartimento Sci Informaz, I-00198 Rome, Italy
来源：
THEORETICAL COMPUTER SCIENCE | 2000年 / 233卷 / 1-2期
关键词：
systolic automata; automata on omega-words; decidable monadic second order logic;
D O I：
10.1016/S0304-3975(97)00257-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The class of omega-languages recognized by systolic (binary) tree automata is introduced. This class extends the class of Buchi omega-languages though maintaining the closure under union, intersection and complement and the decidability of emptiness. The class of systolic tree omega-languages is characterized in terms of a (suitable) concatenation of(finitary) systolic tree languages, A generalization of Buchi Theorem is provided which establishes a correspondence between systolic tree omega-languages and a suitable extension of the sequential calculus SIS. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：1 / 18
页数：18
相关论文
共 50 条
  • [1] Logical definability of Y-tree and trellis systolic ω-languages
    Angelo, M.
    Adriano, P.
    [J]. Acta Cybernetica, 2001, 15 (01): : 75 - 100
  • [2] A logical characterization of systolic languages
    Monti, A
    Peron, A
    [J]. STACS 98 - 15TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1998, 1373 : 466 - 476
  • [3] COMPLETENESS RESULTS CONCERNING SYSTOLIC TREE AUTOMATA AND EOL LANGUAGES
    MONTI, A
    RONCATO, A
    [J]. INFORMATION PROCESSING LETTERS, 1995, 53 (01) : 11 - 16
  • [4] LOGICAL COMPLEXITY OF SOME CLASSES OF TREE-LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA
    BUSZKOWSKI, W
    [J]. ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1980, 26 (01): : 41 - 49
  • [5] CLOSURE-PROPERTIES OF THE FAMILY OF LANGUAGES DEFINED BY SYSTOLIC TREE AUTOMATA
    PARDUBSKA, D
    [J]. COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1988, 7 (01): : 59 - 64
  • [6] A KLEENE-LIKE CHARACTERIZATION OF LANGUAGES ACCEPTED BY SYSTOLIC TREE AUTOMATA
    FACHINI, E
    MONTI, A
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1994, 49 (01) : 133 - 147
  • [7] ON A FAMILY OF L-LANGUAGES RESULTING FROM SYSTOLIC TREE AUTOMATA
    CULIK, K
    GRUSKA, J
    SALOMAA, A
    [J]. THEORETICAL COMPUTER SCIENCE, 1983, 23 (03) : 231 - 242
  • [8] LANGUAGES ACCEPTED BY SYSTOLIC Y-TREE AUTOMATA - STRUCTURAL CHARACTERIZATIONS
    FACHINI, E
    MONTI, A
    NAPOLI, M
    PARENTE, D
    [J]. ACTA INFORMATICA, 1992, 29 (08) : 761 - 778
  • [9] Operational State Complexity of Subtree-Free Regular Tree Languages
    Ko, Sang-Ki
    Eom, Hae-Sung
    Han, Yo-Sub
    [J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (06) : 705 - 724
  • [10] Tree Tuple Languages from the Logic Programming Point of View
    Sébastien Limet
    Gernot Salzer
    [J]. Journal of Automated Reasoning, 2006, 37 : 323 - 349
12345