6 citations · 16 across the 8 of their papers we have counts for
9 papers
Synchronizing automata and principal eigenvectors of the underlying digraphs
Vladimir V. Gusev, Elena V. Pribavkina
A coloring of a digraph with a fixed out-degree k is a distribution of k labels over the edges resulting in a deterministic finite automaton. An automaton is called synchronizing i…
Reset thresholds of automata with two cycle lengths
Vladimir V. Gusev, Elena V. Pribavkina
We present several series of synchronizing automata with multiple parameters, generalizing previously known results. Let p and q be two arbitrary co-prime positive integers, q > p.…
A Coloring Problem for Infinite Words
Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni
In this paper we consider the following question in the spirit of Ramsey theory: Given where is a finite non-empty set, does there exist a finite coloring of the no…
Finitely generated ideal languages and synchronizing automata
Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina
We study representations of ideal languages by means of strongly connected synchronizing automata. For every finitely generated ideal language L we construct such an automaton with…
Principal ideal languages and synchronizing automata
Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina
We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the langu…
A Coloring Problem for Sturmian and Episturmian Words
Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni
We consider the following open question in the spirit of Ramsey theory: Given an aperiodic infinite word , does there exist a finite coloring of its factors such that no factori…