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 条
  • [1] On the Palindromic Hosoya Polynomial of Trees
    Badulin, Dmitry
    Grebennikov, Alexandr
    Vorob'ev, Konstantin
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2022, 88 (02) : 471 - 478
  • [2] On the palindromic complexity of infinite words
    Brlek, S
    Hamel, S
    Nivat, M
    Reutenauer, C
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2004, 15 (02) : 293 - 306
  • [3] Palindromic complexity of codings of rotations
    Masse, A. Blondin
    Brlek, S.
    Labbe, S.
    Vuillon, L.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (46) : 6455 - 6463
  • [4] Complexity and palindromic defect of infinite words
    Brlek, S.
    Reutenauer, C.
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (4-5) : 493 - 497
  • [5] Palindromic trees for a sliding window and its applications
    Mieno, Takuya
    Watanabe, Kiichi
    Nakashima, Yuto
    Inenaga, Shunsuke
    Bannai, Hideo
    Takeda, Masayuki
    INFORMATION PROCESSING LETTERS, 2022, 173
  • [6] UPPER BOUND FOR PALINDROMIC AND FACTOR COMPLEXITY OF RICH WORDS
    Rukavicka, Josef
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2021, 55
  • [7] Upper bound for palindromic and factor complexity of rich words
    Rukavicka, Josef
    RAIRO - Theoretical Informatics and Applications, 2021, 55
  • [8] A connection between palindromic and factor complexity using return words
    Bucci, Michelangelo
    De Luca, Alessandro
    Glen, Amy
    Zamboni, Luca Q.
    ADVANCES IN APPLIED MATHEMATICS, 2009, 42 (01) : 60 - 74
  • [9] FACTOR AND PALINDROMIC COMPLEXITY OF THUE-MORSE'S AVATARS
    Frougny, Christiane
    Klouda, Karel
    ACTA POLYTECHNICA, 2013, 53 (06) : 868 - 871
  • [10] Palindromic complexity of infinite words associated with simple Parry numbers
    Ambroz, Petr
    Masakova, Zuzana
    Pelantova, Edita
    Frougny, Christiane
    ANNALES DE L INSTITUT FOURIER, 2006, 56 (07) : 2131 - 2160
12345