Zobrazeno 1 - 10
of 325
pro vyhledávání: '"de Luca, Aldo"'
We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse images under suitable morphisms, preserve the aforementioned classes
Externí odkaz:
http://arxiv.org/abs/1602.03231
Autor:
de Luca, Aldo, Zamboni, Luca Q.
We consider the class ${\cal P}_1$ of all infinite words $x\in A^\omega$ over a finite alphabet $A$ admitting a prefixal factorization, i.e., a factorization $x= U_0 U_1U_2 \cdots $ where each $U_i$ is a non-empty prefix of $x.$ With each $x\in {\cal
Externí odkaz:
http://arxiv.org/abs/1505.02309
Autor:
de Luca, Aldo, Zamboni, Luca Q.
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of monochrom
Externí odkaz:
http://arxiv.org/abs/1504.06807
Autor:
de Luca, Aldo, De Luca, Alessandro
Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by representing central
Externí odkaz:
http://arxiv.org/abs/1410.4085
In this paper we consider the following question in the spirit of Ramsey theory: Given $x\in A^\omega,$ where $A$ is a finite non-empty set, does there exist a finite coloring of the non-empty factors of $x$ with the property that no factorization of
Externí odkaz:
http://arxiv.org/abs/1307.2828
We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word $w$, does there exist a finite coloring of its factors such that no factorization of $w$ is monochromatic? We show that such a coloring always ex
Externí odkaz:
http://arxiv.org/abs/1301.5263
Autor:
de Luca, Aldo
We prove that the Fibonacci word $f$ satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two properties c
Externí odkaz:
http://arxiv.org/abs/1209.3927
Autor:
de Luca, Aldo, De Luca, Alessandro
Publikováno v:
Theoretical Computer Science 454 (2012) 109-128
The palindromization map $\psi$ in a free monoid $A^*$ was introduced in 1997 by the first author in the case of a binary alphabet $A$, and later extended by other authors to arbitrary alphabets. Acting on infinite words, $\psi$ generates the class o
Externí odkaz:
http://arxiv.org/abs/1111.1823
Publikováno v:
Theoretical Computer Science 407 (2008) 569--573
In this paper we explore various interconnections between rich words, Sturmian words, and trapezoidal words. Rich words, first introduced in arXiv:0801.1656 by the second and third authors together with J. Justin and S. Widmer, constitute a new class
Externí odkaz:
http://arxiv.org/abs/0802.3885
Publikováno v:
In Theoretical Computer Science 7 January 2017 658 Part A:122-147
