標(biāo)題: Titlebook: Combinatorics on Words; 9th International Co Juhani Karhum?ki,Arto Lepist?,Luca Zamboni Conference proceedings 2013 Springer-Verlag Berlin [打印本頁] 作者: 討論小組 時(shí)間: 2025-3-21 17:57
書目名稱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é)科排名
作者: debris 時(shí)間: 2025-3-21 23:31 作者: savage 時(shí)間: 2025-3-22 00:43
Shirumisha Kwayu,Banita Lal,Mumin Abubakreprocess. An intermediate role is played by the notion od word trees for which some properties of words are generalized. In particular, we describe an infinite family of binary automata, called . and constructed by using standard sturmian words and more specifically Fibonacci words, that represent th作者: META 時(shí)間: 2025-3-22 05:13
SpringerBriefs in Molecular Sciencefree monoid is naturally represented as a highly non regular tree whose nodes are the integers and whose subtrees are all distinct. With every node of that tree is then associated a minimal infinite word (and a maximal infinite word)..The main result is that a sequential transducer which computes fo作者: crumble 時(shí)間: 2025-3-22 09:53
Realistic Vehicular Networks Simulationsdorandom number generators. An infinite word . on a .-ary alphabet has the WDO property if, for each factor . of ., positive integer ., and vector .., there is an occurrence of . such that the Parikh vector of the prefix of . preceding such occurrence is congruent to . modulo .. We prove that Sturmi作者: Atmosphere 時(shí)間: 2025-3-22 13:49
Bruno F. de Azevedo,Nelio D. Pizzolatofull discrete plane when, starting from a finite seed, we iterate the multidimensional dual substitutions associated with .. We apply our results to study the substitutions associated with the Brun multidimensional continued fraction algorithm.作者: Atmosphere 時(shí)間: 2025-3-22 18:19 作者: Yourself 時(shí)間: 2025-3-22 22:36
https://doi.org/10.1007/978-3-030-12255-3oung tableaux is a cross-section of this congruence which happens to be regular. The main result of this work shows that the set of alphabetically minimal elements in the congruence classes is also regular. We give a full combinatorial characterization of these minimal elements and show that constru作者: 諷刺 時(shí)間: 2025-3-23 03:57
LoRaWan: Low Cost Solution for Smart Citiesorbit closure of ..(.) and . is the shift operation. Let . be a finite alphabet that is in bijective correspondence via a mapping . with the set of nonempty suffixes of the images .(.) for .?∈?.. Let . be the set of infinite words s?=?(..). such that .. We show that if . is primitive and .(.) is a s作者: Fibroid 時(shí)間: 2025-3-23 07:13
New Methods for Self-Calibration of Currents.(.). Thus . satisfies the Dual PCP if and only if it belongs to a non-trivial equality set. Words which do not satisfy the Dual PCP are called ., and are important to the study of word equations, equality sets and ambiguity of morphisms. In this paper, a ‘prime’ subset of periodicity forcing words 作者: 沙草紙 時(shí)間: 2025-3-23 10:14
Smart Self-Correcting D/A ConvertersBrun words on 3?letters and Arnoux-Rauzy words over arbitrary alphabets are finitely balanced; in particular, boundedness of the strong partial quotients implies balancedness. On the other hand, we provide examples of unbalanced Brun words on 3 letters.作者: 背書 時(shí)間: 2025-3-23 14:52
https://doi.org/10.1007/978-94-007-0347-6pen. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard 作者: dilute 時(shí)間: 2025-3-23 18:57
New Methods for Self-Calibration of Currentsfle of two square-free words . and .. Then we show that there exists an infinite square-free word . on three letters such that . can be shuffled with itself to produce another infinite square-free word. The proof of the latter result is constructive on finite factors, and it relies on a computer pro作者: 兩棲動物 時(shí)間: 2025-3-23 22:58
Smart Self-Correcting D/A Convertersds . and . are .-abelian equivalent if every factor of length at most . occurs in . as many times as in .. The usual abelian equivalence coincides with 1-abelian equivalence. Usually .-abelian squares are defined as words . for which there exist non-empty .-abelian equivalent words . and . such that作者: Largess 時(shí)間: 2025-3-24 02:26
https://doi.org/10.1007/978-1-4302-0254-7ive an overview of the results concerning repetition-freeness in connection with similarity relations. We consider so called chain relations, cyclic relations and partial words, which can be seen as a special case of similarity relations. As a new result, we prove that local 3.-repetitions can be av作者: grounded 時(shí)間: 2025-3-24 06:45
https://doi.org/10.1007/978-3-642-40579-2algorithm analysis and problem complexity作者: Intercept 時(shí)間: 2025-3-24 12:27 作者: 神經(jīng) 時(shí)間: 2025-3-24 18:07 作者: 可互換 時(shí)間: 2025-3-24 22:43
Bruno F. de Azevedo,Nelio D. Pizzolatofull discrete plane when, starting from a finite seed, we iterate the multidimensional dual substitutions associated with .. We apply our results to study the substitutions associated with the Brun multidimensional continued fraction algorithm.作者: Flatter 時(shí)間: 2025-3-24 23:10
https://doi.org/10.1007/978-3-030-12255-3oung tableaux is a cross-section of this congruence which happens to be regular. The main result of this work shows that the set of alphabetically minimal elements in the congruence classes is also regular. We give a full combinatorial characterization of these minimal elements and show that constructing them is as fast as constructing a tableau.作者: PHONE 時(shí)間: 2025-3-25 03:41 作者: N斯巴達(dá)人 時(shí)間: 2025-3-25 08:54
Generating Discrete Planes with Substitutionsfull discrete plane when, starting from a finite seed, we iterate the multidimensional dual substitutions associated with .. We apply our results to study the substitutions associated with the Brun multidimensional continued fraction algorithm.作者: heartburn 時(shí)間: 2025-3-25 13:01
The Lexicographic Cross-Section of the Plactic Monoid Is Regularoung tableaux is a cross-section of this congruence which happens to be regular. The main result of this work shows that the set of alphabetically minimal elements in the congruence classes is also regular. We give a full combinatorial characterization of these minimal elements and show that constructing them is as fast as constructing a tableau.作者: 四指套 時(shí)間: 2025-3-25 18:16 作者: impaction 時(shí)間: 2025-3-25 20:46
Juhani Karhum?ki,Arto Lepist?,Luca Zamboni9th International Conference on Words, WORDS 2013作者: 憤憤不平 時(shí)間: 2025-3-26 00:31 作者: Connotation 時(shí)間: 2025-3-26 05:32 作者: 松緊帶 時(shí)間: 2025-3-26 11:54 作者: 群島 時(shí)間: 2025-3-26 13:54
New Harmonic-Distortion-Suppression MethodWe study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language . we construct such an automaton with at most 2. states, where . is the maximal length of words in .. Our constructions are based on the De Bruijn graph.作者: kidney 時(shí)間: 2025-3-26 18:29
Deterministic Semi-Thue Systems and Variants of Post Correspondence ProblemWe study recent undecidability result on deterministic semi-Thue systems, and it is applications in the variants of Post Correspondence Problem. Namely, we discuss the ideas of the new proofs for the circular PCP and the .-permutation PCP.作者: Original 時(shí)間: 2025-3-26 21:33
Non-constructive Methods for Avoiding Repetitions in WordsWe survey several different non-constructive methods for showing the avoidability of certain kinds of repetitions in words.作者: Corporeal 時(shí)間: 2025-3-27 01:59
Finitely Generated Ideal Languages and Synchronizing AutomataWe study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language . we construct such an automaton with at most 2. states, where . is the maximal length of words in .. Our constructions are based on the De Bruijn graph.作者: 大吃大喝 時(shí)間: 2025-3-27 09:18 作者: Ataxia 時(shí)間: 2025-3-27 12:22 作者: arsenal 時(shí)間: 2025-3-27 15:20 作者: aviator 時(shí)間: 2025-3-27 20:26
Auto-similarity in Rational Base Number Systemsfree monoid is naturally represented as a highly non regular tree whose nodes are the integers and whose subtrees are all distinct. With every node of that tree is then associated a minimal infinite word (and a maximal infinite word)..The main result is that a sequential transducer which computes fo作者: callous 時(shí)間: 2025-3-27 23:44
Infinite Words with Well Distributed Occurrencesdorandom number generators. An infinite word . on a .-ary alphabet has the WDO property if, for each factor . of ., positive integer ., and vector .., there is an occurrence of . such that the Parikh vector of the prefix of . preceding such occurrence is congruent to . modulo .. We prove that Sturmi作者: Interlocking 時(shí)間: 2025-3-28 03:24
Generating Discrete Planes with Substitutionsfull discrete plane when, starting from a finite seed, we iterate the multidimensional dual substitutions associated with .. We apply our results to study the substitutions associated with the Brun multidimensional continued fraction algorithm.作者: Electrolysis 時(shí)間: 2025-3-28 08:14 作者: Cultivate 時(shí)間: 2025-3-28 11:09
The Lexicographic Cross-Section of the Plactic Monoid Is Regularoung tableaux is a cross-section of this congruence which happens to be regular. The main result of this work shows that the set of alphabetically minimal elements in the congruence classes is also regular. We give a full combinatorial characterization of these minimal elements and show that constru作者: Aerate 時(shí)間: 2025-3-28 16:30 作者: 被告 時(shí)間: 2025-3-28 20:21 作者: 顛簸下上 時(shí)間: 2025-3-29 02:53 作者: Licentious 時(shí)間: 2025-3-29 03:51
Open and Closed Prefixes of Sturmian Wordspen. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard 作者: 執(zhí)拗 時(shí)間: 2025-3-29 07:20 作者: 傻瓜 時(shí)間: 2025-3-29 12:38 作者: Abominate 時(shí)間: 2025-3-29 19:06
Similarity Relations and Repetition-Freenessive an overview of the results concerning repetition-freeness in connection with similarity relations. We consider so called chain relations, cyclic relations and partial words, which can be seen as a special case of similarity relations. As a new result, we prove that local 3.-repetitions can be av作者: Abnormal 時(shí)間: 2025-3-29 21:44 作者: Jejune 時(shí)間: 2025-3-30 03:55 作者: 祖先 時(shí)間: 2025-3-30 05:32
LoRaWan: Low Cost Solution for Smart Citiesuffix code, then there exists a mapping . such that . is a topological dynamical system and . is a conjugacy. We call . the . of (., .). Furthermore, in the special case when . is the Fibonacci or the Thue-Morse morphism, we show that . is a sofic shift, that is, the language of . is regular.作者: 加入 時(shí)間: 2025-3-30 08:43
Smart Self-Correcting D/A Converters .?=?.. The new way to consider .-abelian .th powers is to say that a word is . if it is .-abelian equivalent to an .th power. We prove that strongly .-abelian .th powers are not avoidable on any alphabet for any numbers . and .. In the abelian case this is easy, but for .?>?1 the proof is not trivial.作者: 瘋狂 時(shí)間: 2025-3-30 13:32
https://doi.org/10.1007/978-3-030-04315-5amically equivalent to a given uniform morphism is finite, if the morphisms are one-to-one and if we ignore changes of alphabet. We will present the equivalence class of the Toeplitz morphism 0?→?01, 1?→?00. This is joint work with Ethan Coven and Mike Keane.作者: 向下 時(shí)間: 2025-3-30 19:06
Shirumisha Kwayu,Banita Lal,Mumin Abubakre is considered, such family of word automata represent the worst case for the number of steps and for its overall time complexity. This fact suggests that the standard sturmian words, and consequently the associated word automata, are able to capture some properties for which the minimization process becomes inherently more complex.作者: Chromatic 時(shí)間: 2025-3-31 00:21
Dynamical Equivalence of Morphismsamically equivalent to a given uniform morphism is finite, if the morphisms are one-to-one and if we ignore changes of alphabet. We will present the equivalence class of the Toeplitz morphism 0?→?01, 1?→?00. This is joint work with Ethan Coven and Mike Keane.作者: 微塵 時(shí)間: 2025-3-31 03:25 作者: Corral 時(shí)間: 2025-3-31 07:22
SpringerBriefs in Molecular Scienceinite words are then interpreted as representations of real numbers; the difference between the numbers represented by the maximal and minimal word associated with?. is called the span of?.. The preceding construction allows to characterise the topological closure of the set of spans.作者: MILK 時(shí)間: 2025-3-31 11:14 作者: 謙卑 時(shí)間: 2025-3-31 14:42 作者: 流浪 時(shí)間: 2025-3-31 21:31
Periodicity Forcing Wordsrmore, it is shown that there exist examples of periodicity forcing words which contain any given factor/prefix/suffix. Finally, an alternative class of mechanisms for generating periodicity forcing words is developed, resulting in a class of examples which contrast those known already.作者: monologue 時(shí)間: 2025-3-31 22:27
0302-9743 natorics on Words, WORDS 2013, held in Turku, Finland, in September 2013 under the auspices of the EATCS. The 20 revised full papers presented were carefully reviewed and selected from 43 initial submissions. The central topic of the conference is combinatorics on words (i.e. the study of finite and作者: 匍匐前進(jìn) 時(shí)間: 2025-4-1 05:20
Shirumisha Kwayu,Banita Lal,Mumin Abubakrebe interpreted geometrically. I will discuss a version of Pansiot’s theorem about the complexity of fixed points of substitutions in the context of automorphisms of free groups. This is based on joint work with Arnaud Hilion.作者: cornucopia 時(shí)間: 2025-4-1 08:30 作者: Bumptious 時(shí)間: 2025-4-1 12:43
