ダウンロード数: 24
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
2188-20.pdf | 9.2 MB | Adobe PDF | 見る/開く |
完全メタデータレコード
DCフィールド | 値 | 言語 |
---|---|---|
dc.contributor.author | Fazekas, Szilárd Zsolt | en |
dc.contributor.author | Mercaş, Robert | en |
dc.date.accessioned | 2021-11-01T01:40:54Z | - |
dc.date.available | 2021-11-01T01:40:54Z | - |
dc.date.issued | 2021-07 | - |
dc.identifier.uri | http://hdl.handle.net/2433/265626 | - |
dc.description.abstract | This work proposes a new approach towards solving an over 20 years old conjecture regarding the maximum number of distinct squares that a word can contain. To this end we look at clusters of repetition roots, that is, the set of positions where the root u of a repetition u^[l] occurs. We lay the foundation of this theory by proving basic properties of these clusters and establishing upper bounds on the number of distinct squares when their roots form a chain with respect to the prefix order. | en |
dc.language.iso | eng | - |
dc.publisher | 京都大学数理解析研究所 | ja |
dc.publisher.alternative | Research Institute for Mathematical Sciences, Kyoto University | en |
dc.subject.ndc | 410 | - |
dc.title | Clusters of repetition roots: single chains (Algebraic system, Logic, Language and Related Areas in Computer Sciences II) | en |
dc.type | departmental bulletin paper | - |
dc.type.niitype | Departmental Bulletin Paper | - |
dc.identifier.ncid | AN00061013 | - |
dc.identifier.jtitle | 数理解析研究所講究録 | ja |
dc.identifier.volume | 2188 | - |
dc.identifier.spage | 131 | - |
dc.identifier.epage | 140 | - |
dc.textversion | publisher | - |
dc.sortkey | 20 | - |
dc.address | Akita University, Graduate School of Engineering Science | en |
dc.address | Loughborough University, Department of Computer Science | en |
dcterms.accessRights | open access | - |
datacite.awardNumber | 19K11815 | - |
datacite.awardNumber.uri | https://kaken.nii.ac.jp/ja/grant/KAKENHI-PROJECT-19K11815/ | - |
dc.identifier.pissn | 1880-2818 | - |
dc.identifier.jtitle-alternative | RIMS Kokyuroku | en |
jpcoar.funderName | 日本学術振興会 | ja |
jpcoar.awardTitle | Clusters of repetition roots | en |
出現コレクション: | 2188 代数系、論理、言語と計算機科学の周辺 II |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。