3 citations · 9 across the 5 of their papers we have counts for
6 papers
Finite and infinite closed-rich words
Olga Parshina, Svetlana Puzynina
A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in c…
Open and closed complexity of infinite words
O. Parshina, M. Postic
In this paper we study the asymptotic behaviour of two relatively new complexity functions defined on infinite words and their relationship to periodicity. Given a factor of an…
On perfect colorings of infinite multipath graphs
M. A. Lisitsyna, S. V. Avgustinovich, O. G. Parshina
A coloring of vertices of a given graph is called perfect if the color structure of each ball of radius in the graph depends only on the color of the ball center. Let be a…
The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
O. G. Parshina, M. A. Lisitsyna
A vertex coloring of a given simple graph with colors (-coloring) is a map from its vertex set to the set of integers . A coloring is called pe…
On arithmetic index in the generalized Thue-Morse word
Olga Parshina
Let be a positive integer. Consider an infinite word over an alphabet of cardinality . A finite word is called an arithmetic factor of if $u=w_cw…
Open and closed factors of Arnoux-Rauzy words
Olga Parshina, Luca Zamboni
A finite word is called closed if its longest repeated prefix has exactly two occurrences in once as a prefix and once as a suffix. We study the function $f_x^c:\mathbb N…