433 search results - page 1 / 87 » On stabilizers of infinite words |
TCS
2008
13 years 10 months ago
2008
The stabilizer of an infinite word w over a finite alphabet is the monoid of morphisms over that fix w. In this paper we study various problems related to stabilizers and their g...
SIAMJO
2010
13 years 9 months ago
2010
Abstract. This paper concerns second-order analysis for a remarkable class of variational systems in finite-dimensional and infinite-dimensional spaces, which is particularly imp...
STRINGOLOGY
2008
14 years 9 days ago
2008
In a recent paper, Brlek et al showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: what are the infinite smooth w...
DMTCS
2010
13 years 8 months ago
2010
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only...
DM
2010
13 years 11 months ago
2010
An infinite word is S-automatic if, for all n 0, its (n+1)st letter is the output of a deterministic automaton fed with the representation of n in the numeration system S. In this...