Palindromic Complexity of Trees

被引：5
|
作者：
Brlek, Srecko [1 ]
Lafreniere, Nadia [1 ]
Provencal, Xavier [2 ]
机构：
[1] Univ Quebec, Montreal, PQ H3C 3P8, Canada
[2] Univ Savoie, Chambery, France
来源：
DEVELOPMENTS IN LANGUAGE THEORY (DLT 2015) | 2015年 / 9168卷
关键词：
Words; Trees; Language; Palindromic complexity; Sidon sets; EPISTURMIAN WORDS;
D O I：
10.1007/978-3-319-21500-6_12
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider finite trees with edges labeled by letters on a finite alphabet Sigma. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid Sigma*. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.
引用
收藏
页码：155 / 166
页数：12
相关论文
共 50 条
  • [41] On the complexity of the representation of simplicial complexes by trees
    Boissonnat, Jean-Daniel
    Mazauric, Dorian
    THEORETICAL COMPUTER SCIENCE, 2016, 617 : 28 - 44
  • [42] A Survey of the Distributional Complexity for AND-OR Trees
    Peng, Weiguang
    COMPUTABILITY THEORY AND FOUNDATIONS OF MATHEMATICS, CTFM 2019, 2022, : 79 - 96
  • [43] Circuits versus trees in algebraic complexity
    Koiran, P
    STACS 2000: 17TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 2000, 1770 : 35 - 52
  • [44] COMPLEXITY OF COMPUTING STEINER MINIMAL TREES
    GAREY, MR
    GRAHAM, RL
    JOHNSON, DS
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (04) : 835 - 859
  • [45] Games on trees and syntactical complexity of formulas
    Krynicki, Michal
    Torres, Jose Maria Turull
    LOGIC JOURNAL OF THE IGPL, 2007, 15 (5-6) : 653 - 687
  • [46] Query Complexity of Inversion Minimization on Trees
    Hu, Ivan
    van Melkebeek, Dieter
    Morgan, Andrew
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2836 - 2866
  • [47] Distance approximating trees: Complexity and algorithms
    Dragan, Feodor F.
    Yan, Chenyu
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 260 - 271
  • [48] MORPHOLOGICAL WAVELETS AND THE COMPLEXITY OF DYADIC TREES
    Xiang, Zhen James
    Ramadge, Peter J.
    2010 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2010, : 4030 - 4033
  • [49] THE SPACE COMPLEXITY OF PEBBLE GAMES ON TREES
    LENGAUER, T
    TARJAN, RE
    INFORMATION PROCESSING LETTERS, 1980, 10 (4-5) : 184 - 188
  • [50] Parameterized Complexity of Weighted Multicut in Trees
    Galby, Esther
    Marx, Daniel
    Philipp, Schepper
    Sharma, Roohani
    Tale, Prafullkumar
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2022), 2022, 13453 : 257 - 270
12345