Titlebook: Combinatorics on Words; 9th International Co Juhani Karhum?ki,Arto Lepist?,Luca Zamboni Conference proceedings 2013 Springer-Verlag Berlin

Original

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

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.

大吃大喝

Ataxia

arsenal

aviator

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

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

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

Cultivate

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