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 条
  • [1] ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
    Esik, Zoltan
    Weil, Pascal
    INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2010, 20 (02) : 195 - 239
  • [2] Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages
    Kobele, Gregory M.
    LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS, LACL 2011, 2011, 6736 : 129 - 144
  • [3] Cut sets as recognizable tree languages
    Borchardt, Bjoern
    Maletti, Andreas
    Seselja, Branimir
    Tepavcevic, Andreja
    Vogler, Heiko
    FUZZY SETS AND SYSTEMS, 2006, 157 (11) : 1560 - 1571
  • [4] MAT Learners for Recognizable Tree Languages and Tree Series
    Drewes, Frank
    ACTA CYBERNETICA, 2009, 19 (02): : 249 - 274
  • [5] AN UPPER BOUND ON THE COMPLEXITY OF RECOGNIZABLE TREE LANGUAGES
    Finkel, Olivier
    Lecomte, Dominique
    Simonnet, Pierre
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2015, 49 (02): : 121 - 137
  • [6] Minimal equational representations of recognizable tree languages
    Fulop, Z
    Vagvolgyi, S
    ACTA INFORMATICA, 1997, 34 (01) : 59 - 84
  • [7] Weighted Languages Recognizable by Weighted Tree Automata
    Fulop, Zoltan
    Gazdag, Zsolt
    ACTA CYBERNETICA, 2018, 23 (03): : 867 - 886
  • [8] On the topological complexity of weakly recognizable tree languages
    Duparc, Jacques
    Murlak, Filip
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2007, 4639 : 261 - +
  • [9] Minimal equational representations of recognizable tree languages
    Zoltán Fülöp
    Sándor Vágvölgyi
    Acta Informatica, 1997, 34 : 59 - 84
  • [10] On Recognizable Tree Languages Beyond the Borel Hierarchy
    Finkel, Olivier
    Simonnet, Pierre
    FUNDAMENTA INFORMATICAE, 2009, 95 (2-3) : 287 - 303
12345