標(biāo)題: Titlebook: Combinatorics on Words; 13th International C Thierry Lecroq,Svetlana Puzynina Conference proceedings 2021 Springer Nature Switzerland AG 20 [打印本頁(yè)] 作者: 戰(zhàn)神 時(shí)間: 2025-3-21 17:39
書目名稱Combinatorics on Words影響因子(影響力)
書目名稱Combinatorics on Words影響因子(影響力)學(xué)科排名
書目名稱Combinatorics on Words網(wǎng)絡(luò)公開度
書目名稱Combinatorics on Words網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Combinatorics on Words被引頻次
書目名稱Combinatorics on Words被引頻次學(xué)科排名
書目名稱Combinatorics on Words年度引用
書目名稱Combinatorics on Words年度引用學(xué)科排名
書目名稱Combinatorics on Words讀者反饋
書目名稱Combinatorics on Words讀者反饋學(xué)科排名
作者: 憤世嫉俗者 時(shí)間: 2025-3-21 23:55
Binary Cyclotomic Polynomials: Representation via Words and Algorithms,t to the size of the output, and, thus, optimal. This approach allows to recover known properties of coefficients of binary cyclotomic polynomials, and extends to the case of polynomials associated with numerical semi-groups of dimension 2.作者: famine 時(shí)間: 2025-3-22 04:26
Equations over the ,-Binomial Monoids,ding on . and the size of the underlying alphabet, on the number of equations in such a finite subsystem. We further consider commutativity and conjugacy in the .-binomial monoids. We characterise 2-binomial conjugacy and 2-binomial commutativity. We also obtain partial results on .-binomial commutativity for ..作者: 使厭惡 時(shí)間: 2025-3-22 05:42
Conference proceedings 2021f words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc..作者: 財(cái)產(chǎn) 時(shí)間: 2025-3-22 09:47 作者: LINE 時(shí)間: 2025-3-22 15:54
https://doi.org/10.1007/978-1-4302-0254-7s an infinity of different lacunary alphabets of the form . with . and . sufficiently large such that . takes arbitrarily large values for words on these alphabets. The method of proof relies in part on a combinatorial characterisation of the word . in the class . where . assumes its maximum.作者: LINE 時(shí)間: 2025-3-22 19:22
The Guerrilla Guide to Interviewing,t to the size of the output, and, thus, optimal. This approach allows to recover known properties of coefficients of binary cyclotomic polynomials, and extends to the case of polynomials associated with numerical semi-groups of dimension 2.作者: 統(tǒng)治人類 時(shí)間: 2025-3-22 22:40
Jagana Bihari Padhy,Bijayananda Patnaikding on . and the size of the underlying alphabet, on the number of equations in such a finite subsystem. We further consider commutativity and conjugacy in the .-binomial monoids. We characterise 2-binomial conjugacy and 2-binomial commutativity. We also obtain partial results on .-binomial commutativity for ..作者: 描述 時(shí)間: 2025-3-23 03:11
Conference proceedings 2021r 2021...?..The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects o作者: 治愈 時(shí)間: 2025-3-23 06:38 作者: FRAX-tool 時(shí)間: 2025-3-23 11:58 作者: FACT 時(shí)間: 2025-3-23 16:53
Doubled Patterns with Reversal Are 3-Avoidable,is . if every variable occurs at least twice. Doubled patterns are known to be 3-avoidable. Currie, Mol, and Rampersad have considered a generalized notion which allows variable occurrences to be reversed. That is, . is the mirror image of .(.) for every .. We show that doubled patterns with reversal are 3-avoidable.作者: 收到 時(shí)間: 2025-3-23 20:15 作者: 無(wú)所不知 時(shí)間: 2025-3-23 22:23 作者: obviate 時(shí)間: 2025-3-24 04:03
The Guerrilla Guide to Interviewing,prove their decidability, resp. undecidability. Notably, the most common theories in real-world benchmarks are .-complete and directly lead to the implementation of a more efficient algorithm to solving string constraints.作者: QUAIL 時(shí)間: 2025-3-24 07:49
Tomasz Szczuraszek,Jacek Chmielewskiow that there are two phenomena through which words can have morphically imprimitive heirs, and we highlight that only one of those occurs in morphically primitive words. Finally, we examine our concept further, use it to rephrase the Billaud Conjecture and study its difficulty.作者: exhilaration 時(shí)間: 2025-3-24 12:01 作者: 加花粗鄙人 時(shí)間: 2025-3-24 18:34
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back,prove their decidability, resp. undecidability. Notably, the most common theories in real-world benchmarks are .-complete and directly lead to the implementation of a more efficient algorithm to solving string constraints.作者: 變形 時(shí)間: 2025-3-24 20:28
On Billaud Words and Their Companions,ow that there are two phenomena through which words can have morphically imprimitive heirs, and we highlight that only one of those occurs in morphically primitive words. Finally, we examine our concept further, use it to rephrase the Billaud Conjecture and study its difficulty.作者: Pelago 時(shí)間: 2025-3-25 02:28 作者: Bouquet 時(shí)間: 2025-3-25 06:04
https://doi.org/10.1007/978-1-4302-0254-7We study balanced sequences over a .-letter alphabet. Each such sequence . is described by a Sturmian sequence and two constant gap sequences . and .. We provide an algorithm which for a given ., . and a quadratic slope of a Sturmian sequence computes the critical exponent of the balanced sequence ..作者: Hangar 時(shí)間: 2025-3-25 08:20 作者: 確定的事 時(shí)間: 2025-3-25 15:23
Assessment of BEVs Use in Urban EnvironmentAn efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length . over the alphabet . is presented.作者: investigate 時(shí)間: 2025-3-25 16:29
Smart and Healthy Walking in Smart Cities,An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many finite Lyndon words as prefixes. A characterization of binary endomorphisms generating Lyndon infinite words is provided.作者: 攀登 時(shí)間: 2025-3-25 19:58
Computation of Critical Exponent in Balanced Sequences,We study balanced sequences over a .-letter alphabet. Each such sequence . is described by a Sturmian sequence and two constant gap sequences . and .. We provide an algorithm which for a given ., . and a quadratic slope of a Sturmian sequence computes the critical exponent of the balanced sequence ..作者: 金桌活畫面 時(shí)間: 2025-3-26 01:04 作者: AGONY 時(shí)間: 2025-3-26 07:58 作者: 禁止 時(shí)間: 2025-3-26 08:59 作者: Coma704 時(shí)間: 2025-3-26 14:29 作者: 魯莽 時(shí)間: 2025-3-26 20:10 作者: 搖擺 時(shí)間: 2025-3-26 22:54 作者: 感染 時(shí)間: 2025-3-27 04:15 作者: multiply 時(shí)間: 2025-3-27 07:34
https://doi.org/10.1007/978-1-4302-0254-7f words. Moreover, if sequence is synchronized, then one can use a theorem-prover such as . to “automatically” prove many results about it, with little human intervention. In this paper I will prove some of the basic properties of synchronization, and give a number of applications to combinatorics o作者: LIMN 時(shí)間: 2025-3-27 11:06
https://doi.org/10.1007/978-1-4302-0254-7 as a function defined on the set of all finite words on the alphabet . with values in the positive integers. Given a word . with . we define its multiplicity . as the number of times the value .(.) is assumed in the Abelian class . consisting of all permutations of the word .. We prove that there i作者: ligature 時(shí)間: 2025-3-27 15:41
The Guerrilla Guide to Interviewing,se vertices which contain a given .-ary word . as a factor is here introduced and called the .. When, for any ., such a subgraph is isometric to the cube, the word . is said .. In the binary case, isometric words can be equivalently defined, independently from hypercubes. A binary word . is isometri作者: Optic-Disk 時(shí)間: 2025-3-27 18:55 作者: abracadabra 時(shí)間: 2025-3-27 22:47
The Guerrilla Guide to Interviewing,ich can be applied in this context, especially for real-world cases. Designing an algorithm for the (generally undecidable) satisfiability problem for systems of string constraints requires a thorough understanding of the structure of constraints present in the targeted cases. In this paper, we inve作者: Hla461 時(shí)間: 2025-3-28 04:02 作者: Gudgeon 時(shí)間: 2025-3-28 09:46
Hadi Khabbaz,Yang Xiao,Jia-Ruey Changignal processing, speech analysis and recognition, information retrieval, data compression, computational biology and chemistry. In the last few decades a myriad of alternative solutions have been proposed, based on very different techniques. However, automata have always played a very important rol作者: urethritis 時(shí)間: 2025-3-28 10:37
Assessment of BEVs Use in Urban Environment of perfectly clustering words are Christoffel words and their conjugates. In this paper, we show another similarity between perfectly clustering words and Christoffel words: Both are positive primitive elements of the free group.作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-28 17:11 作者: ALOFT 時(shí)間: 2025-3-28 22:44
Kaan Y?ld?zg?z,Hüseyin Murat ?elik. is a non-erasing morphism. A pattern . is said to be .-avoidable if there exists an infinite word over a .-letter alphabet that avoids .. A pattern is . if every variable occurs at least twice. Doubled patterns are known to be 3-avoidable. Currie, Mol, and Rampersad have considered a generalized n作者: contradict 時(shí)間: 2025-3-29 02:11
S. Christalin Nelson,J. Dhiviya Roseeftmost 1 with the bit to its right. Flip-swap languages model many combinatorial objects including necklaces, Lyndon words, prefix normal words, left factors of .-ary Dyck words, and feasible solutions to 0-1 knapsack problems. We prove that any flip-swap language forms a cyclic 2-Gray code when li作者: 我不重要 時(shí)間: 2025-3-29 04:30
Jagana Bihari Padhy,Bijayananda Patnaik factor. We consider equations in the so-called .-binomial monoid defined by the .-binomial equivalence relation on words. We remark that the .-binomial monoid possesses the compactness property, namely, any system of equations has a finite equivalent subsystem. We further show an upper bound, depen作者: 燒烤 時(shí)間: 2025-3-29 07:53 作者: single 時(shí)間: 2025-3-29 14:01
978-3-030-85087-6Springer Nature Switzerland AG 2021作者: rectum 時(shí)間: 2025-3-29 18:43
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/230055.jpg作者: 蚊帳 時(shí)間: 2025-3-29 23:40
Synchronized Sequences,f words. Moreover, if sequence is synchronized, then one can use a theorem-prover such as . to “automatically” prove many results about it, with little human intervention. In this paper I will prove some of the basic properties of synchronization, and give a number of applications to combinatorics on words.作者: 遠(yuǎn)足 時(shí)間: 2025-3-30 00:03 作者: 灌輸 時(shí)間: 2025-3-30 07:32 作者: 大都市 時(shí)間: 2025-3-30 10:15 作者: sultry 時(shí)間: 2025-3-30 16:26
Hadi Khabbaz,Yang Xiao,Jia-Ruey Changange Automaton Matcher, which turns out to be very fast in many practical cases. Despite our algorithm has a quadratic worst-case time complexity, experimental results show that it obtains in most cases the best running times when compared against the most effective automata based algorithms. In the作者: 話 時(shí)間: 2025-3-30 18:38 作者: 馬具 時(shí)間: 2025-3-30 21:09
Continuants with Equal Values, a Combinatorial Approach, as a function defined on the set of all finite words on the alphabet . with values in the positive integers. Given a word . with . we define its multiplicity . as the number of times the value .(.) is assumed in the Abelian class . consisting of all permutations of the word .. We prove that there i作者: 大氣層 時(shí)間: 2025-3-31 01:01 作者: critique 時(shí)間: 2025-3-31 08:01 作者: mastopexy 時(shí)間: 2025-3-31 12:41
String Theories Involving Regular Membership Predicates: From Practice to Theory and Back,ich can be applied in this context, especially for real-world cases. Designing an algorithm for the (generally undecidable) satisfiability problem for systems of string constraints requires a thorough understanding of the structure of constraints present in the targeted cases. In this paper, we inve作者: BOON 時(shí)間: 2025-3-31 16:56
Binary Cyclotomic Polynomials: Representation via Words and Algorithms,n of their order, and the binary case is thus the first nontrivial case. This paper sees the vector of coefficients of the polynomial as a word on a ternary alphabet .. It designs an efficient algorithm that computes a compact representation of this word. This algorithm is of linear time with respec
