Displaying similar documents to “Hereditary properties of words”

On low-complexity bi-infinite words and their factors

Alex Heinis (2001)

Journal de théorie des nombres de Bordeaux

Similarity:

In this paper we study bi-infinite words on two letters. We say that such a word has stiffness k if the number of different subwords of length n equals n + k for all n sufficiently large. The word is called k -balanced if the numbers of occurrences of the symbol a in any two subwords of the same length differ by at most k . In the present paper we give a complete description of the class of bi-infinite words of stiffness k and show that the number of subwords of length n from this class has...

Complexity of infinite words associated with beta-expansions

Christiane Frougny, Zuzana Masáková, Edita Pelantová (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We study the complexity of the infinite word u β associated with the Rényi expansion of 1 in an irrational base β > 1 . When β is the golden ratio, this is the well known Fibonacci word, which is sturmian, and of complexity ( n ) = n + 1 . For β such that d β ( 1 ) = t 1 t 2 t m is finite we provide a simple description of the structure of special factors of the word u β . When t m = 1 we show that ( n ) = ( m - 1 ) n + 1 . In the cases when t 1 = t 2 = = t m - 1 or t 1 > max { t 2 , , t m - 1 } we show that the first difference of the complexity function ( n + 1 ) - ( n ) takes value in { m - 1 , m } for every n , and consequently...

Containers and wide diameters of P 3 ( G )

Daniela Ferrero, Manju K. Menon, A. Vijayakumar (2012)

Mathematica Bohemica

Similarity:

The P 3 intersection graph of a graph G has for vertices all the induced paths of order 3 in G . Two vertices in P 3 ( G ) are adjacent if the corresponding paths in G are not disjoint. A w -container between two different vertices u and v in a graph G is a set of w internally vertex disjoint paths between u and v . The length of a container is the length of the longest path in it. The w -wide diameter of G is the minimum number l such that there is a w -container of length at most l between any pair...

On Christoffel classes

Jean-Pierre Borel, Christophe Reutenauer (2006)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We characterize conjugation classes of Christoffel words (equivalently of standard words) by the number of factors. We give several geometric proofs of classical results on these words and sturmian words.

*-sturmian words and complexity

Izumi Nakashima, Jun-Ichi Tamura, Shin-Ichi Yasutomi (2003)

Journal de théorie des nombres de Bordeaux

Similarity:

We give analogs of the complexity p ( n ) and of Sturmian words which are called respectively the * -complexity p * ( n ) and * -Sturmian words. We show that the class of * -Sturmian words coincides with the class of words satisfying p * ( n ) n + 1 , and we determine the structure of * -Sturmian words. For a class of words satisfying p * ( n ) = n + 1 , we give a general formula and an upper bound for p ( n ) . Using this general formula, we give explicit formulae for p ( n ) for some words belonging to this class. In general, p ( n ) can take large...

Cycle and path embedding on 5-ary N-cubes

Tsong-Jie Lin, Sun-Yuan Hsieh, Hui-Ling Huang (2009)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

We study two topological properties of the 5-ary n -cube Q n 5 . Given two arbitrary distinct nodes x and y in Q n 5 , we prove that there exists an x - y path of every length ranging from 2 n to 5 n - 1 , where n 2 . Based on this result, we prove that Q n 5 is 5-edge-pancyclic by showing that every edge in Q n 5 lies on a cycle of every length ranging from 5 to 5 n .

On the distribution of characteristic parameters of words

Arturo Carpi, Aldo de Luca (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

For any finite word w on a finite alphabet, we consider the basic parameters R w and K w of w defined as follows: R w is the minimal natural number for which w has no right special factor of length R w and K w is the minimal natural number for which w has no repeated suffix of length K w . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length on a fixed alphabet.