2 citations · 5 across the 6 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2016
Primitive sets of nonnegative matrices and synchronizing automata
Balázs Gerencsér, Vladimir V. Gusev, Raphaël M. Jungers
A set of nonnegative matrices is called primitive if there exist indices such that …
cs.FL2013★ 1 cited
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…
cs.FL2011★ 2 cited
On Non-Complete Sets and Restivo's Conjecture
Vladimir V. Gusev, Elena V. Pribavkina
A finite set S of words over the alphabet A is called non-complete if Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be uncompletable. We present a series of n…