3 citations · 9 across the 5 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020★ 2 cited
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…
math.CO2020★ 3 cited
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…