Logical definability of Y-tree and trellis systolic ω-languages

被引：0
|
作者：
Angelo, M. [1 ]
Adriano, P. [1 ]
机构：
[1] Dipto. Scienze dell'Informazione, Univ. di Roma (La Sapienza), 00198, Via Salaria 113, Italy
来源：
Acta Cybernetica | 2001年 / 15卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we investigate the correspondence (in the style of the well known Buchi Theorem) between ω-languages accepted by systolic automata and suitable (proper) extensions of the Monadic Second Order theory of one successor (MSO[
引用
收藏
页码：75 / 100
相关论文
共 21 条
  • [1] CLASSES OF SYSTOLIC Y-TREE AUTOMATA AND A COMPARISON WITH SYSTOLIC TRELLIS AUTOMATA
    FACHINI, E
    MAGGIOLOSCHETTINI, A
    SANGIORGI, D
    [J]. ACTA INFORMATICA, 1992, 29 (6-7) : 623 - 643
  • [2] 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
  • [3] COMPARISONS AMONG CLASSES OF Y-TREE SYSTOLIC AUTOMATA
    FACHINI, E
    SCHETTINI, AM
    SANGIORGI, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 254 - 260
  • [4] POWER OF INTERCONNECTIONS AND OF NONDETERMINISM IN REGULAR Y-TREE SYSTOLIC AUTOMATA
    FACHINI, E
    GRUSKA, J
    NAPOLI, M
    PARENTE, D
    [J]. MATHEMATICAL SYSTEMS THEORY, 1995, 28 (03): : 245 - 266
  • [5] Systolic tree ω-languages:: the operational and the logical view
    Monti, A
    Peron, A
    [J]. THEORETICAL COMPUTER SCIENCE, 2000, 233 (1-2) : 1 - 18
  • [6] Languages and logical definability in concurrency monoids
    Droste, M
    Kuske, D
    [J]. COMPUTER SCIENCE LOGIC, 1996, 1092 : 233 - 251
  • [7] SYSTOLIC Y-TREE AUTOMATA - CLOSURE-PROPERTIES AND DECISION-PROBLEMS
    FACHINI, E
    MONTI, A
    NAPOLI, M
    PARENTE, D
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 210 - 219
  • [8] A Note on the Logical Definability of Rational Trace Languages
    Choffrut, Christian
    [J]. FUNDAMENTA INFORMATICAE, 2012, 116 (1-4) : 45 - 50
  • [9] LOGICAL DEFINABILITY OF SOME RATIONAL TRACE LANGUAGES
    CHOFFRUT, C
    GUERRA, L
    [J]. MATHEMATICAL SYSTEMS THEORY, 1995, 28 (05): : 397 - 420
  • [10] 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
123