On the Number of Non-equivalent Parameterized Squares in a String

Rikuya Hamai, Kazushi Taketsugu, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

抄録

A string s is called a parameterized square when s=xy for strings x, y and x and y are parameterized equivalent. Kociumaka et al. showed the number of parameterized squares, which are non-equivalent in parameterized equivalence, in a string of length n that contains σ distinct characters is at most 2σ!n [TCS 2016]. In this paper, we show that the maximum number of non-equivalent parameterized squares is less than σn, which significantly improves the best-known upper bound by Kociumaka et al.

本文言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Proceedings
編集者Zsuzsanna Lipták, Edleno Moura, Karina Figueroa, Ricardo Baeza-Yates
出版社Springer Science and Business Media Deutschland GmbH
ページ174-183
ページ数10
ISBN(印刷版)9783031721991
DOI
出版ステータス出版済み - 2025
イベント31st International Symposium on String Processing and Information Retrieval, SPIRE 2024 - Puerto Vallarta, メキシコ
継続期間: 9月 23 20249月 25 2024

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
14899 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議31st International Symposium on String Processing and Information Retrieval, SPIRE 2024
国/地域メキシコ
CityPuerto Vallarta
Period9/23/249/25/24

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータサイエンス一般

引用スタイル