標題: Titlebook: Combinatorics on Words; 11th International C Sre?ko Brlek,Francesco Dolce,élise Vandomme Conference proceedings 2017 Springer International [打印本頁] 作者: 女孩 時間: 2025-3-21 19:22
書目名稱Combinatorics on Words影響因子(影響力)
書目名稱Combinatorics on Words影響因子(影響力)學科排名
書目名稱Combinatorics on Words網絡公開度
書目名稱Combinatorics on Words網絡公開度學科排名
書目名稱Combinatorics on Words被引頻次
書目名稱Combinatorics on Words被引頻次學科排名
書目名稱Combinatorics on Words年度引用
書目名稱Combinatorics on Words年度引用學科排名
書目名稱Combinatorics on Words讀者反饋
書目名稱Combinatorics on Words讀者反饋學科排名
作者: ELATE 時間: 2025-3-21 22:34
https://doi.org/10.1007/978-3-319-59454-5equence when the cycles are ordered in colexicographic order with respect to their co-necklace representatives. We also give an algorithm that produces the de Bruijn sequence in .(1)-time per bit. Finally, we prove that our construction has a discrepancy bounded above by 2..作者: exhibit 時間: 2025-3-22 00:46
Smart Innovation, Systems and Technologiests . such that ., for some .. In this paper, we extend a series of classical repetition enforcing word equations to this general setting to obtain a series of word equations whose solutions are [.]-repetitions.作者: 悶熱 時間: 2025-3-22 05:33 作者: Facilities 時間: 2025-3-22 10:05
Equations Enforcing Repetitions Under Permutations,ts . such that ., for some .. In this paper, we extend a series of classical repetition enforcing word equations to this general setting to obtain a series of word equations whose solutions are [.]-repetitions.作者: Pantry 時間: 2025-3-22 16:43
Conference proceedings 2017crete geometry plays an expanding role in the fields of shape modeling, image synthesis, and image analysis. It deals with topological and geometrical definitions of digitized objects or digitized images and provides both a theoretical and computational framework for computer imaging..作者: Pantry 時間: 2025-3-22 19:47
https://doi.org/10.1007/978-3-031-16704-1of the arithmetic index of arithmetic factors of a generalization of the Thue-Morse word defined over an alphabet of prime cardinality. More precisely, we obtain upper and lower bounds for the maximum value of the arithmetic index in . among all its arithmetic factors of length ..作者: esthetician 時間: 2025-3-22 22:55 作者: Keratin 時間: 2025-3-23 01:40 作者: 殺菌劑 時間: 2025-3-23 09:30 作者: debris 時間: 2025-3-23 12:57 作者: 決定性 時間: 2025-3-23 16:30
Minimal Forbidden Factors of Circular Words,is minimal if the input trie recognizes the minimal forbidden factors of a single word. We generalize this result to the case of a circular word. We also discuss combinatorial properties of the minimal forbidden factors of a circular word. Finally, we characterize the minimal forbidden factors of the circular Fibonacci words.作者: 混亂生活 時間: 2025-3-23 18:09 作者: 攤位 時間: 2025-3-24 00:55 作者: VEST 時間: 2025-3-24 02:32
On Arithmetic Index in the Generalized Thue-Morse Word,of the arithmetic index of arithmetic factors of a generalization of the Thue-Morse word defined over an alphabet of prime cardinality. More precisely, we obtain upper and lower bounds for the maximum value of the arithmetic index in . among all its arithmetic factors of length ..作者: 搖曳 時間: 2025-3-24 08:40 作者: 辯論的終結 時間: 2025-3-24 14:45
Combinatorics of Cyclic Shifts in Plactic, Hypoplactic, Sylvester, and Related Monoids,l). This paper discusses new results on the diameters of connected components of the cyclic shift graphs of the finite-rank analogues of these monoids, showing that the maximum diameter of a connected component is dependent only on the rank. The proof techniques are explained in the case of the sylvester monoid.作者: 男生戴手銬 時間: 2025-3-24 17:09
0302-9743 . It deals with topological and geometrical definitions of digitized objects or digitized images and provides both a theoretical and computational framework for computer imaging..978-3-319-66395-1978-3-319-66396-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Kaleidoscope 時間: 2025-3-24 19:05 作者: bourgeois 時間: 2025-3-24 23:10
Colleen Heinemann,Vladimir L. Uskovtail and compare their properties to the Sturmian case. The main results are characterizations of periodic points and the limit set. The results show that while there is some similarity it is possible for the square root map to exhibit quite different behavior compared to the Sturmian case.作者: alcohol-abuse 時間: 2025-3-25 04:03 作者: Ceremony 時間: 2025-3-25 11:24 作者: 遭遇 時間: 2025-3-25 13:22
https://doi.org/10.1007/978-3-319-66396-8blind source separation; christoffel words; combinatorics on words; efficient text algorithms; palindrom作者: 鳴叫 時間: 2025-3-25 17:48 作者: allude 時間: 2025-3-25 23:46
https://doi.org/10.1007/978-981-13-1423-0We survey some properties of simple relations between words.作者: 評論者 時間: 2025-3-26 03:18 作者: rheumatology 時間: 2025-3-26 08:02
Innovations in Smart Universities,We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich word.作者: Shuttle 時間: 2025-3-26 11:34
Smart Innovation, Systems and TechnologiesWe characterize the left normal forms of conjugates of Christoffel words and compute their minimal period. This answers two open questions in Reutenauer (2015).作者: 利用 時間: 2025-3-26 14:16
https://doi.org/10.1007/978-3-031-16704-1In this paper, we study the Thue-Morse word on a ternary alphabet. We establish some properties on special factors of this word and prove that it is 2-balanced. Moreover, we determine its Abelian complexity function.作者: Morphine 時間: 2025-3-26 17:43 作者: Angiogenesis 時間: 2025-3-26 23:38
Overpals, Underlaps, and Underpals,An overlap in a word is a factor of the form ., where . is a (possibly empty) word and . is a single letter; these have been well-studied since Thue’s landmark paper of 1906. In this note we consider three new variations on this well-known definition and some consequences.作者: Ergots 時間: 2025-3-27 02:53
On Words with the Zero Palindromic Defect,We study the set of finite words with zero palindromic defect, i.e., words rich in palindromes. This set is factorial, but not recurrent. We focus on description of pairs of rich words which cannot occur simultaneously as factors of a longer rich word.作者: 案發(fā)地點 時間: 2025-3-27 08:50 作者: Criteria 時間: 2025-3-27 11:35 作者: catagen 時間: 2025-3-27 16:15 作者: Malfunction 時間: 2025-3-27 21:50
Matching Lexicographic and Conjugation Orders on the Conjugation Class of a Special Sturmian Morphile letters . and ., with the standard morphism of the class as the smallest element in this order. We show that a lexicographic order on the morphisms of the given conjugation class can be defined that matches the conjugation order.作者: 考博 時間: 2025-3-28 01:53
A Set of Sequences of Complexity ,,are constructed from an infinite product of two substitutions according to a particular Multidimensional Continued Fraction algorithm. We show that this algorithm is conjugate to a well-known one, the Selmer algorithm. Experimentations (Baldwin, 1992) suggest that their second Lyapunov exponent is negative which presages finite balance properties.作者: 廚師 時間: 2025-3-28 06:02 作者: 貪婪的人 時間: 2025-3-28 07:48 作者: escalate 時間: 2025-3-28 10:44 作者: 假裝是我 時間: 2025-3-28 15:34 作者: 腐敗 時間: 2025-3-28 21:50
https://doi.org/10.1007/978-3-030-32875-7hey have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.?[IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifa作者: ALIEN 時間: 2025-3-28 23:59
https://doi.org/10.1007/978-3-319-59454-5ally smallest string in an equivalence class of strings induced by the CCR. We prove that a concatenation of the cycles of the CCR forms a de Bruijn sequence when the cycles are ordered in colexicographic order with respect to their co-necklace representatives. We also give an algorithm that produce作者: 產生 時間: 2025-3-29 03:16
Smart Innovation, Systems and Technologies permutations: give an alphabet . and a morphism or antimorphism . on ., whose restriction to . is a permutation, . is an [.]-repetition if there exists . such that ., for some .. In this paper, we extend a series of classical repetition enforcing word equations to this general setting to obtain a s作者: ostrish 時間: 2025-3-29 10:47
Innovations in Smart Universities,le letters . and ., with the standard morphism of the class as the smallest element in this order. We show that a lexicographic order on the morphisms of the given conjugation class can be defined that matches the conjugation order.作者: debris 時間: 2025-3-29 11:37 作者: 滑稽 時間: 2025-3-29 15:38 作者: 串通 時間: 2025-3-29 19:44 作者: 保存 時間: 2025-3-30 02:50
https://doi.org/10.1007/978-3-031-16704-1 . ., as the maximal exponential growth rate of a complexity function smaller than .. This is in general smaller than ., and more difficult to compute; we give an algorithm to estimate it. The quantity . is used to compute the Hausdorff dimension of the set of real numbers whose expansions in a give作者: Estrogen 時間: 2025-3-30 04:50 作者: 殺死 時間: 2025-3-30 10:36 作者: subordinate 時間: 2025-3-30 13:27
Ethical Classification of Postal Customers For certain monoids connected with combinatorics, such as the plactic monoid (the monoid of Young tableaux) and the sylvester monoid (the monoid of binary search trees), connected components consist of elements that have the same evaluation (that is, contain the same number of each generating symbo作者: Bureaucracy 時間: 2025-3-30 18:55 作者: 大看臺 時間: 2025-3-30 23:00
Sre?ko Brlek,Francesco Dolce,élise VandommeIncludes supplementary material: 作者: Agronomy 時間: 2025-3-31 04:46
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230052.jpg作者: 褻瀆 時間: 2025-3-31 05:26
Combinatorics on Words978-3-319-66396-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: projectile 時間: 2025-3-31 09:31 作者: 痛得哭了 時間: 2025-3-31 16:30
Innovations in Smart Universities,le letters . and ., with the standard morphism of the class as the smallest element in this order. We show that a lexicographic order on the morphisms of the given conjugation class can be defined that matches the conjugation order.作者: CLAIM 時間: 2025-3-31 21:10 作者: 細胞膜 時間: 2025-4-1 01:15 作者: adroit 時間: 2025-4-1 04:27
Ethical Classification of Postal Customerss, such as the one proposed by Bresenham, or the concept of Cutting Sequence. Our method relies on the concept of .. The sequence of pixels in black or in various levels of gray is coded on some alphabet, which depends on the multi-pixel, and the structure of these encodings is discussed.作者: 使饑餓 時間: 2025-4-1 09:56
Church-Rosser Systems, Codes with Bounded Synchronization Delay and Local Rees Extensions,he first obvious answer is that each of these notions relates to topics of interest for WORDS: Church-Rosser systems are certain rewriting systems over words, codes are given by sets of words which form a basis of a free submonoid in the free monoid of all words (over a given alphabet) and local Ree作者: occurrence 時間: 2025-4-1 13:47 作者: POLYP 時間: 2025-4-1 18:00 作者: Anal-Canal 時間: 2025-4-1 19:45
A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register,ally smallest string in an equivalence class of strings induced by the CCR. We prove that a concatenation of the cycles of the CCR forms a de Bruijn sequence when the cycles are ordered in colexicographic order with respect to their co-necklace representatives. We also give an algorithm that produce
