MANIFOLDS OF AUTOMATA DESCENDING FROM INFINITE-TREES

被引：0
|
作者：
SAOUDI, A
机构：
来源：
THEORETICAL COMPUTER SCIENCE | 1986年 / 43卷 / 2-3期
关键词：
D O I：
10.1016/0304-3975(86)90183-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：315 / 335
页数：21
相关论文
共 50 条
  • [41] KANGAROO CAUGHT DESCENDING FROM THE TREES
    RODGERS, P
    NEW SCIENTIST, 1994, 143 (1936) : 8 - 8
  • [42] MANIFOLDS OF AUTOMATA
    PLOTKIN, BI
    DIDIDZE, TE
    KUBLANOVA, EM
    DOKLADY AKADEMII NAUK SSSR, 1975, 221 (06): : 1284 - 1287
  • [43] Two-Way Cost Automata and Cost Logics over Infinite Trees
    Blumensath, Achim
    Colcombet, Thomas
    Kuperberg, Denis
    Parys, Pawel
    Vanden Boom, Michael
    PROCEEDINGS OF THE JOINT MEETING OF THE TWENTY-THIRD EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC (CSL) AND THE TWENTY-NINTH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2014,
  • [44] Infinite labeled trees: From rational to Sturmian trees
    Gast, Nicolas
    Gaujal, Bruno
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) : 1146 - 1166
  • [45] Automata on Infinite Biposets
    Nemeth, Zoltan L.
    ACTA CYBERNETICA, 2006, 17 (04): : 765 - 797
  • [46] AUTOMATA ON INFINITE WORDS
    PERRIN, D
    INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS, 1994, 51 : 491 - 492
  • [47] Automata for unordered trees
    Boiret, Adrien
    Hugot, Vincent
    Niehren, Joachim
    Treinen, Ralf
    INFORMATION AND COMPUTATION, 2017, 253 : 304 - 335
  • [48] Minimal ascending and descending tree automata
    Nivat, M
    Podelski, A
    SIAM JOURNAL ON COMPUTING, 1997, 26 (01) : 39 - 58
  • [49] INFERENCE OF TREE AUTOMATA FROM SAMPLE SET OF TREES
    FUKUDA, H
    KAMATA, K
    INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (03): : 177 - 196
  • [50] Trees of metric compacta and trees of manifolds
    Swiatkowski, Jacek
    GEOMETRY & TOPOLOGY, 2020, 24 (02) : 533 - 592
12345