On logically defined recognizable tree languages

被引：0
|
作者：
Ésik, Z
Weil, P
机构：
[1] Univ Szeged, Dept Comp Sci, Szeged, Hungary
[2] CNRS, LaBRI, F-75700 Paris, France
[3] Univ Bordeaux 1, F-33405 Talence, France
来源：
FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE | 2003年 / 2914卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We provide an algebraic characterization of the expressive power of various naturally defined logics on finite trees. These logics are described in terms of Lindstrom quantifiers, and particular cases include first-order logic and modular logic. The algebraic characterization we give is expressed in terms of a new algebraic structure, finitary preclones, and uses a generalization of the block product operation.
引用
收藏
页码：195 / 207
页数：13
相关论文
共 50 条
  • [41] Recognizable picture languages and domino tiling
    Latteux, M
    Simplot, D
    THEORETICAL COMPUTER SCIENCE, 1997, 178 (1-2) : 275 - 283
  • [42] Languages recognizable by quantum finite automata
    Freivalds, R
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, 2006, 3845 : 1 - 14
  • [43] RATIONAL AND RECOGNIZABLE COMPLEX TRACE LANGUAGES
    DIEKERT, V
    GASTIN, P
    PETIT, A
    INFORMATION AND COMPUTATION, 1995, 116 (01) : 134 - 153
  • [44] ON THE STRUCTURE OF RECOGNIZABLE LANGUAGES OF DEPENDENCE GRAPHS
    EHRENFEUCHT, A
    HOOGEBOOM, HJ
    ROZENBERG, G
    RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1993, 27 (01): : 7 - 22
  • [45] Local and recognizable iso picture languages
    Kalyani, T
    Dare, VR
    Thomas, DG
    NEURAL INFORMATION PROCESSING, 2004, 3316 : 738 - 743
  • [46] Context-sensitive string languages and recognizable picture languages
    Latteux, M
    Simplot, D
    INFORMATION AND COMPUTATION, 1997, 138 (02) : 160 - 169
  • [47] Classification of String Languages via Tiling Recognizable Picture Languages
    Anselmo, Marcella
    Giammarresi, Dora
    Madonia, Maria
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, 2011, 6638 : 105 - +
  • [48] Quantum recognizable tree functions
    Bozapalidis, S
    UNCONVENTIONAL MODELS OF COMPUTATION UMC' 2K, PROCEEDINGS, 2001, : 25 - 47
  • [49] Recognizable Tree Series with Discounting
    Mandrah, Eleni
    Rahonis, George
    ACTA CYBERNETICA, 2009, 19 (02): : 411 - 439
  • [50] Taxonomies of logically defined qualitative spatial relations
    Cohn, AG
    Randell, DA
    Cui, Z
    INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES, 1995, 43 (5-6) : 831 - 846
12345