82
Voted
ITA
2008
15 years 17 days ago
2008
98
Voted
ITA
2008
15 years 17 days ago
2008
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...
93
Voted
ITA
2008
15 years 17 days ago
2008
130
Voted
ITA
2008
15 years 17 days ago
2008
We prove two cases of a strong version of Dejean's conjecture involving extremal letter frequencies. The results are that there exist an infinite " 5 4 + " -free wor...
90
Voted
ITA
2008
15 years 17 days ago
2008
In this article, we study the complexity of drunken man infinite words. We show that these infinite words, generated by a deterministic and complete countable automaton, or equival...
87
Voted
ITA
2008
15 years 17 days ago
2008
In this paper we solve some open problems related to (pseudo)palindrome closure operators and to the infinite words generated by their iteration, that is, standard episturmian and...
114
Voted
ITA
2008
15 years 17 days ago
2008
We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying iterations of unimodal continuous maps from the unit interva...
77
Voted
ITA
2008
15 years 17 days ago
2008
We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word...
87
Voted
ITA
2008
15 years 17 days ago
2008
It is studied how taking the inverse image by a sliding block code affects the syntactic semigroup of a sofic subshift. Two independent approaches are used: -semigroups as recogni...
IJHPCA
2006
15 years 17 days ago
2006
In this paper, we consider the communications involved in the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-com...