This article is cited in 6 papers

Existence of an infinite word with a Rauzy graph sequence that contains a subsequence of homeomorphs of graphs of the given sequence

P. V. Salimov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: We investigate infinite words on a finite alphabet and prove that for any sequence of strongly connected directed graphs with maximal in and out vertices degrees that are equal to $s$ there exists a uniformly recurrent infinite word on a $s$-letters alphabet with a Rauzy graph sequence that contains a subsequence of homeomorphs of graphs of the given sequence. Bibl. 5.

Keywords: infinite words, uniform reccurancy, Rauzy graph, de Brain graphs.

UDC: 519.101

Received: 14.04.2008
Revised: 18.08.2008

 English version: Journal of Applied and Industrial Mathematics, 2010, 4:1, 127–135

Bibliographic databases:

• 
• 
• 
•