標題: Titlebook: Combinatorics on Words; 14th International C Anna Frid,Robert Merca? Conference proceedings 2023 The Editor(s) (if applicable) and The Auth [打印本頁] 作者: 詭計 時間: 2025-3-21 18:36
書目名稱Combinatorics on Words影響因子(影響力)
書目名稱Combinatorics on Words影響因子(影響力)學科排名
書目名稱Combinatorics on Words網(wǎng)絡公開度
書目名稱Combinatorics on Words網(wǎng)絡公開度學科排名
書目名稱Combinatorics on Words被引頻次
書目名稱Combinatorics on Words被引頻次學科排名
書目名稱Combinatorics on Words年度引用
書目名稱Combinatorics on Words年度引用學科排名
書目名稱Combinatorics on Words讀者反饋
書目名稱Combinatorics on Words讀者反饋學科排名
作者: Esalate 時間: 2025-3-21 23:19 作者: Fluctuate 時間: 2025-3-22 02:31 作者: 使激動 時間: 2025-3-22 07:31 作者: 是他笨 時間: 2025-3-22 10:38 作者: 要求比…更好 時間: 2025-3-22 15:51
String Attractors of?Fixed Points of?,-Bonacci-Like Morphismss. In this paper, we obtain string attractors of prefixes of particular infinite words generalizing .-bonacci words (including the famous Fibonacci word) and obtained as fixed points of .-bonacci-like morphisms. In fact, our description involves the numeration systems classically derived from the considered morphisms.作者: 要求比…更好 時間: 2025-3-22 20:34 作者: otic-capsule 時間: 2025-3-23 00:24
Conference proceedings 2023 also contains 3 invited papers. WORDS? is the main conference series devoted to combinatorics on words. This area is connected to several topics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics.作者: 群居男女 時間: 2025-3-23 02:42 作者: 立即 時間: 2025-3-23 08:49
Conference proceedings‘‘‘‘‘‘‘‘ 2021 of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.作者: Inkling 時間: 2025-3-23 10:43
Ezio Micelli,Alessia Mangialardofactor complexity we determine the number of factors of the Fibonacci sequence sharing the same Parikh vector. We deduce a formula based on expansion of integers in a particular non-standard numeration system.作者: Detain 時間: 2025-3-23 16:08 作者: 直言不諱 時間: 2025-3-23 20:30
https://doi.org/10.1007/978-3-030-57764-3ird, we give some results on another extremal variation of BP-factorization, the .. A . of a word . is a non-empty word that is both a proper prefix and suffix of .. Finally, we conclude by showing a connection between words with a unique border and words whose smallest and largest BP-factorizations coincide.作者: Apogee 時間: 2025-3-23 23:09 作者: 有害 時間: 2025-3-24 05:39 作者: AROMA 時間: 2025-3-24 07:02 作者: CULP 時間: 2025-3-24 13:46
Conference proceedings 2023g June 12–16, 2023..The 19 contributed papers presented in this book were carefully reviewed and selected from 28 submissions. In addition, the volume also contains 3 invited papers. WORDS? is the main conference series devoted to combinatorics on words. This area is connected to several topics from作者: 集聚成團 時間: 2025-3-24 14:59 作者: Connotation 時間: 2025-3-24 20:09
Magic Numbers in?Periodic Sequences of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.作者: 蕁麻 時間: 2025-3-25 02:06
0302-9743 opics from computer science and mathematics, including string algorithms, automated proofs, discrete dynamics, number theory and, of course, classical combinatorics.978-3-031-33179-4978-3-031-33180-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 小臼 時間: 2025-3-25 04:59 作者: evaculate 時間: 2025-3-25 09:00 作者: ligature 時間: 2025-3-25 11:44 作者: 原來 時間: 2025-3-25 18:35 作者: 樹上結(jié)蜜糖 時間: 2025-3-25 20:16 作者: 某人 時間: 2025-3-26 02:34
978-3-031-33179-4The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: 范例 時間: 2025-3-26 04:50 作者: 瑪瑙 時間: 2025-3-26 09:28
Minimal Complexities for?Infinite Words Written with?, LettersIn this extended abstract, we discuss the minimal subword complexity and the minimal abelian complexity functions for infinite .-ary words. This leads us to answer a question of Rauzy from 1983: cubic billiard words are a good generalization of Sturmian words for the abelian complexity.作者: Esalate 時間: 2025-3-26 13:48
On the?Number of?Distinct Squares in?Finite Sequences: Some Old and?New Resultsed by Fraenkel and Simpson in 1998. They proved that the number of distinct squares, denoted as ., in a finite word . of length . is upper bounded by 2. and conjectured that . is no larger than .. In this note, we review some old and new findings concerning the square-counting problem and prove that ..作者: 發(fā)起 時間: 2025-3-26 20:35 作者: 會議 時間: 2025-3-26 22:03
String Attractors for?Factors of?the?Thue-Morse Worde extend their result by constructing a smallest string attractor for any given factor of the Thue-Morse word. In particular, we show that these string attractors have size at most 5 and that this upper bound is sharp.作者: 繼承人 時間: 2025-3-27 03:39
Critical Exponents of?Regular Arnoux-Rauzy Sequencesncides with a well-known formula for Sturmian sequences based on their S-adic representation. We show that among regular .-ary Arnoux-Rauzy sequences, the minimal (asymptotic) critical exponent is reached by the .-bonacci sequence.作者: 梯田 時間: 2025-3-27 07:44
Order Conditions for?Languages of a generalized interval exchange transformation, while the order condition plus some additional ones characterize the codings of various more classical interval exchange transformations. Also, a finite word clusters for the Burrows-Wheeler transform if and only if the language generated by its powers satisfies an order condition.作者: 暫停,間歇 時間: 2025-3-27 10:22 作者: Veneer 時間: 2025-3-27 17:06
Co-Product Recovery in Food Processinged by Fraenkel and Simpson in 1998. They proved that the number of distinct squares, denoted as ., in a finite word . of length . is upper bounded by 2. and conjectured that . is no larger than .. In this note, we review some old and new findings concerning the square-counting problem and prove that作者: MAUVE 時間: 2025-3-27 19:36
https://doi.org/10.1007/978-3-319-75774-2. appears in . as a subsequence. In this paper, we provide new algorithms for .-subsequence universal words of fixed length . over the alphabet .. Letting . denote the set of .-length .-subsequence universal words over ., we provide:作者: CRATE 時間: 2025-3-27 22:07
https://doi.org/10.1007/978-3-319-75774-2onsider the setting when the distance (i.?e., the gap) between two consecutive symbols of the subsequence has to be between a lower and an upper bound (which may depend on the position of those symbols in the subsequence or on the symbols bordering the gap) as well as the case where the entire subse作者: Exclude 時間: 2025-3-28 04:57
I?igo Lorente-Riverola,Javier Ruiz-Sánchezthe property asking that the image of the return set to a word equals the return set to the image of that word. We show that, for bifix encodings (where images of letters form a bifix code), this property holds for all but finitely many words. On the other hand, we also show that every conjugacy cla作者: 消散 時間: 2025-3-28 08:42 作者: 中止 時間: 2025-3-28 12:20
Ezio Micelli,Alessia Mangialardo there is at least one. We introduce a method using desubstitution of .-automata to describe the structure of preimages of accepted words under arbitrary sequences of homomorphisms: this takes the form of a meta-.-automaton..We decide the existence of an accepted purely substitutive word, as well as作者: Definitive 時間: 2025-3-28 18:23
Markku Mikkola,Ari Jussila,Tapani Ryyn?nene extend their result by constructing a smallest string attractor for any given factor of the Thue-Morse word. In particular, we show that these string attractors have size at most 5 and that this upper bound is sharp.作者: 摸索 時間: 2025-3-28 21:01 作者: 絕食 時間: 2025-3-28 23:15 作者: dagger 時間: 2025-3-29 06:45 作者: climax 時間: 2025-3-29 07:59
https://doi.org/10.1007/978-3-031-39206-1very. Intuitively, the CDAWG of a string . is obtained by merging isomorphic subtrees of the suffix tree [Weiner 1973] of the same string ., thus CDAWGs are a compact indexing structure. In this paper, we investigate the sensitivity of CDAWGs when a single character edit operation (insertion, deleti作者: 粘土 時間: 2025-3-29 13:43 作者: 失誤 時間: 2025-3-29 15:44 作者: Rodent 時間: 2025-3-29 22:50 作者: 驚呼 時間: 2025-3-30 00:36 作者: 煞費苦心 時間: 2025-3-30 05:25
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230057.jpg作者: cloture 時間: 2025-3-30 08:44
Combinatorics on Words978-3-031-33180-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不如樂死去 時間: 2025-3-30 14:24 作者: 干涉 時間: 2025-3-30 20:23
https://doi.org/10.1007/978-3-319-75774-2. appears in . as a subsequence. In this paper, we provide new algorithms for .-subsequence universal words of fixed length . over the alphabet .. Letting . denote the set of .-length .-subsequence universal words over ., we provide:作者: 并置 時間: 2025-3-30 21:18
Markku Mikkola,Ari Jussila,Tapani Ryyn?nene extend their result by constructing a smallest string attractor for any given factor of the Thue-Morse word. In particular, we show that these string attractors have size at most 5 and that this upper bound is sharp.作者: 燒烤 時間: 2025-3-31 03:02
Hatem Mahmoud,Prasanna Divigalpitiyancides with a well-known formula for Sturmian sequences based on their S-adic representation. We show that among regular .-ary Arnoux-Rauzy sequences, the minimal (asymptotic) critical exponent is reached by the .-bonacci sequence.作者: AGOG 時間: 2025-3-31 07:03
Susanne Schatzinger,Chyi Yng Rose Lim of a generalized interval exchange transformation, while the order condition plus some additional ones characterize the codings of various more classical interval exchange transformations. Also, a finite word clusters for the Burrows-Wheeler transform if and only if the language generated by its powers satisfies an order condition.作者: Incorporate 時間: 2025-3-31 10:26
Alternate Base Numeration Systemsases periodically. Such systems naturally appear when considering linear numeration systems without a dominant root. As it happens, many classical results generalize to these numeration systems with multiple bases but some don’t. This is a survey of the work done so far concerning combinatorial, alg作者: Simulate 時間: 2025-3-31 14:34
On the?Number of?Distinct Squares in?Finite Sequences: Some Old and?New Resultsed by Fraenkel and Simpson in 1998. They proved that the number of distinct squares, denoted as ., in a finite word . of length . is upper bounded by 2. and conjectured that . is no larger than .. In this note, we review some old and new findings concerning the square-counting problem and prove that作者: 上流社會 時間: 2025-3-31 17:51 作者: grotto 時間: 2025-3-31 22:16
Longest Common Subsequence with?Gap Constraintsonsider the setting when the distance (i.?e., the gap) between two consecutive symbols of the subsequence has to be between a lower and an upper bound (which may depend on the position of those symbols in the subsequence or on the symbols bordering the gap) as well as the case where the entire subse作者: Musket 時間: 2025-4-1 02:49
On Substitutions Preserving Their Return Setsthe property asking that the image of the return set to a word equals the return set to the image of that word. We show that, for bifix encodings (where images of letters form a bifix code), this property holds for all but finitely many words. On the other hand, we also show that every conjugacy cla作者: 臭名昭著 時間: 2025-4-1 06:09
