14 search results - page 2 / 3 » ita 2008 |
ITA
2008
13 years 4 months ago
2008
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
ITA
2008
13 years 4 months 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...
ITA
2008
13 years 4 months 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...
ITA
2008
13 years 4 months ago
2008
A set T L is a Parikh test set of L iff c(T ) is a test set of c(L). We give an effective characterization of Parikh test sets for arbitrary commutative language.
ITA
2008
13 years 4 months 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...