標(biāo)題: Titlebook: Combinatorics on Words; 10th International C Florin Manea,Dirk Nowotka Conference proceedings 2015 Springer International Publishing Switze [打印本頁(yè)] 作者: exposulate 時(shí)間: 2025-3-21 18:21
書目名稱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é)科排名
作者: Throttle 時(shí)間: 2025-3-21 20:35 作者: 背心 時(shí)間: 2025-3-22 03:14
Linear-Time Computation of Prefix Table for Weighted Strings,ring that matches a prefix of the string. It can be computed in time linear with respect to the size of the string, and hence it can be used efficiently for locating patterns or for regularity searching in strings. A . is a string in which a set of letters may occur at each position with respective 作者: hemoglobin 時(shí)間: 2025-3-22 08:18 作者: Fsh238 時(shí)間: 2025-3-22 10:33 作者: 枯燥 時(shí)間: 2025-3-22 16:56
The Degree of Squares is an Atom, of this partial order of degrees was carried out in?[.], but many basic questions remain unanswered.One of the central questions concerns the existence of atom degrees, other than the degree of the ‘identity sequence’ .. A degree is called an ‘a(chǎn)tom’ if below it there is only the bottom degree?., wh作者: 枯燥 時(shí)間: 2025-3-22 20:47
Arithmetics on Suffix Arrays of Fibonacci Words,sform based on the respective suffix array. We show that the suffix array is a rotation of its inverse under certain conditions, and that the factors of the LZ77 factorization of any Fibonacci word yield again similar characteristics.作者: BOOR 時(shí)間: 2025-3-23 00:22
Prefix-Suffix Square Completion,tion. By suffix square completion (respectively, prefix square completion), one can derive from a word . any word . (respectively, .) if . has a suffix (respectively, prefix) .; by prefix-suffix square completion we derive from a word . any word . that is obtained either by prefix square completion 作者: 館長(zhǎng) 時(shí)間: 2025-3-23 02:43 作者: 拖網(wǎng) 時(shí)間: 2025-3-23 06:01 作者: 的’ 時(shí)間: 2025-3-23 11:16 作者: Migratory 時(shí)間: 2025-3-23 17:46 作者: 乳汁 時(shí)間: 2025-3-23 18:13 作者: 拱形面包 時(shí)間: 2025-3-24 00:58
New Formulas for Dyck Paths in a Rectangle,Dyck words enumerated by the Catalan numbers. By using Ferrers diagrams associated to Dyck paths, we derive formulas for the enumeration of . with . and . non relatively prime, in terms of Catalan numbers.作者: Facet-Joints 時(shí)間: 2025-3-24 02:23
Arithmetics on Suffix Arrays of Fibonacci Words,sform based on the respective suffix array. We show that the suffix array is a rotation of its inverse under certain conditions, and that the factors of the LZ77 factorization of any Fibonacci word yield again similar characteristics.作者: 展覽 時(shí)間: 2025-3-24 08:13 作者: 生意行為 時(shí)間: 2025-3-24 12:06
On the Tree of Ternary Square-Free Words,ucture. First, we show that non-branching paths in this tree are short: such a path from a node of .th level has length .. Second, we prove that any infinite path in the tree has a lot of branching points: the lower density of the set of such points is at least 2/9.作者: Lipohypertrophy 時(shí)間: 2025-3-24 15:27
https://doi.org/10.1007/978-981-16-2109-3ines, sequential finite state transducers and Mealy Machines. For each of these choices, the resulting transducibility relation?. is a preorder on the set of infinite sequences. This preorder induces equivalence classes, called ., and a partial order on the degrees..For Turing Machines, this structu作者: follicular-unit 時(shí)間: 2025-3-24 19:17 作者: needle 時(shí)間: 2025-3-24 23:16 作者: 有雜色 時(shí)間: 2025-3-25 03:39
Smart and Sustainable Cities and BuildingsDyck words enumerated by the Catalan numbers. By using Ferrers diagrams associated to Dyck paths, we derive formulas for the enumeration of . with . and . non relatively prime, in terms of Catalan numbers.作者: 高興一回 時(shí)間: 2025-3-25 11:35 作者: NEXUS 時(shí)間: 2025-3-25 13:54
Density and Quality of Life in Mashhad, Iran of this partial order of degrees was carried out in?[.], but many basic questions remain unanswered.One of the central questions concerns the existence of atom degrees, other than the degree of the ‘identity sequence’ .. A degree is called an ‘a(chǎn)tom’ if below it there is only the bottom degree?., wh作者: Nonthreatening 時(shí)間: 2025-3-25 15:57 作者: Introvert 時(shí)間: 2025-3-25 21:40 作者: EVEN 時(shí)間: 2025-3-26 03:38
Go Muan Sang,Lai Xu,Paul de Vrieze with it, it is also conjectured that binary words have the largest square density. That is, it is sufficient to solve the square conjecture for words over binary alphabet. We solve this subsidiary conjecture affirmatively, or more strongly, we prove the irrelevance of the alphabet size in solving t作者: Daily-Value 時(shí)間: 2025-3-26 06:36
Thomas Sü?e,Maria Kobert,Caroline Kries-automatic”. This class includes, for example, the famous Tribonacci word ., the fixed point of the morphism ., ., .. We use our decision procedure to reprove some old results about the Tribonacci word from the literature, such as assertions about the occurrences in . of squares, cubes, palindromes,作者: 積習(xí)難改 時(shí)間: 2025-3-26 08:58 作者: 范例 時(shí)間: 2025-3-26 13:58
Go Muan Sang,Lai Xu,Paul de Vriezein its language. A minimal square does not have a square as a proper prefix. A Sturmian word . of slope . can be written as a product of these six minimal squares: .. The square root of . is defined to be the word .. We prove that . is also a Sturmian word of slope .. Moreover, we describe how to fi作者: reaching 時(shí)間: 2025-3-26 20:24
https://doi.org/10.1007/978-3-030-18240-3ucture. First, we show that non-branching paths in this tree are short: such a path from a node of .th level has length .. Second, we prove that any infinite path in the tree has a lot of branching points: the lower density of the set of such points is at least 2/9.作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-27 00:48
Baoguo Han,Liqing Zhang,Jinping OuThis paper gives a survey on efficient algorithms for checking equality of grammar-compressed strings, i.e., strings that are represented succinctly by so called straight-line programs.作者: 推遲 時(shí)間: 2025-3-27 01:51 作者: Pander 時(shí)間: 2025-3-27 08:47 作者: 阻撓 時(shí)間: 2025-3-27 13:05
Christophe Maudoux,Selma BoumerdassiThe aim of the present article is twofold. We first give a survey on recent developments on the distribution of symbols in polynomial subsequences of the Thue–Morse sequence . by highlighting effective results. Secondly, we give explicit bounds on .for odd integers .,?., and on .where ., and . is one of (0,?0),?(0,?1),?(1,?0),?(1,?1).作者: 短程旅游 時(shí)間: 2025-3-27 14:44
Smart and Sustainable Cities and BuildingsAn abelian square is the concatenation of two words that are anagrams of one another. A word of length . can contain . distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length . grows quadratically with ..作者: 領(lǐng)導(dǎo)權(quán) 時(shí)間: 2025-3-27 19:38 作者: 脾氣暴躁的人 時(shí)間: 2025-3-28 00:57 作者: 責(zé)難 時(shí)間: 2025-3-28 03:50 作者: 不容置疑 時(shí)間: 2025-3-28 09:40 作者: crutch 時(shí)間: 2025-3-28 13:23
,Thue–Morse Along Two Polynomial Subsequences,The aim of the present article is twofold. We first give a survey on recent developments on the distribution of symbols in polynomial subsequences of the Thue–Morse sequence . by highlighting effective results. Secondly, we give explicit bounds on .for odd integers .,?., and on .where ., and . is one of (0,?0),?(0,?1),?(1,?0),?(1,?1).作者: 多嘴多舌 時(shí)間: 2025-3-28 17:43 作者: 注視 時(shí)間: 2025-3-28 21:35 作者: 值得尊敬 時(shí)間: 2025-3-28 23:18 作者: 咆哮 時(shí)間: 2025-3-29 03:50 作者: 東西 時(shí)間: 2025-3-29 10:14 作者: demote 時(shí)間: 2025-3-29 12:37 作者: Introduction 時(shí)間: 2025-3-29 16:40 作者: Lacunar-Stroke 時(shí)間: 2025-3-29 21:04
Florin Manea,Dirk NowotkaUp-to-date results.Includes supplementary material: 作者: Fester 時(shí)間: 2025-3-30 00:57 作者: 佛刊 時(shí)間: 2025-3-30 04:46 作者: 確保 時(shí)間: 2025-3-30 08:43 作者: 用肘 時(shí)間: 2025-3-30 12:45
https://doi.org/10.1007/978-981-16-2109-3ore interesting to study transducibility with respect to weaker computational models, giving rise to more fine-grained structures of degrees. In contrast with the degrees of unsolvability, very little is known about the structure of degrees obtained from finite state transducers or Mealy Machines.作者: acheon 時(shí)間: 2025-3-30 19:23 作者: 殺死 時(shí)間: 2025-3-31 00:23 作者: 混合物 時(shí)間: 2025-3-31 02:12
Density and Quality of Life in Mashhad, Iranlt we characterise the transducts of ‘spiralling’ sequences and their degrees. We use this to show that every transduct of a ‘polynomial sequence’ either is in?. or can be transduced back to a polynomial sequence for a polynomial of the same order.作者: calamity 時(shí)間: 2025-3-31 08:52 作者: 惹人反感 時(shí)間: 2025-3-31 12:21 作者: Vasodilation 時(shí)間: 2025-3-31 14:55
Linear-Time Computation of Prefix Table for Weighted Strings,e approximation among occurrences of the same DNA segment. In this article, given a weighted string . of length . and a constant . 1?/?., defined as the minimal probability of occurrence of factors in ., we present an .-time algorithm for computing the prefix table of ..作者: REP 時(shí)間: 2025-3-31 18:20 作者: 流動(dòng)性 時(shí)間: 2025-3-31 23:05 作者: Hyperlipidemia 時(shí)間: 2025-4-1 03:18 作者: assent 時(shí)間: 2025-4-1 06:42
