Displaying similar documents to “The subword complexity of a two-parameter family of sequences.”

Drunken man infinite words complexity

Marion Le Gonidec (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

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 equivalently generated by a substitution over a countable alphabet of constant length, have complexity functions equivalent to (log ) when goes to infinity.


On three-rowed chomp.

Brouwer, Andries E., Horváth, Gábor, Molnár-Sáska, Ildikó, Szabó, Csaba (2005)

Integers

Similarity:

A morphic approach to combinatorial games: the Tribonacci case

Eric Duchêne, Michel Rigo (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

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 for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.

Transcendence of numbers with an expansion in a subclass of complexity 2 + 1

Tomi Kärki (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

We divide infinite sequences of subword complexity into four subclasses with respect to left and right special elements and examine the structure of the subclasses with the help of Rauzy graphs. Let ≥ 2 be an integer. If the expansion in base of a number is an Arnoux-Rauzy word, then it belongs to Subclass I and the number is known to be transcendental. We prove the transcendence of numbers with expansions in the subclasses II and III.