Elena V. Pribavkina

According to our database, Elena V. Pribavkina authored at least 19 papers between 2006 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2019

On Codeword Lengths Guaranteeing Synchronization.

Vladimir V. Gusev, Elena V. Pribavkina

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2017

Generalized primitivity of labeled digraphs.

Vladimir V. Gusev, Raphaël M. Jungers, Elena V. Pribavkina

Electron. Notes Discret. Math., 2017

2016

On Synchronizing Colorings and the Eigenvectors of Digraphs.

Vladimir V. Gusev, Elena V. Pribavkina

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Reset Thresholds of Automata with Two Cycle Lengths.

Vladimir V. Gusev, Elena V. Pribavkina

Int. J. Found. Comput. Sci., 2015

Synchronizing automata and principal eigenvectors of the underlying digraphs.

Vladimir V. Gusev, Elena V. Pribavkina

CoRR, 2015

2014

A coloring problem for infinite words.

Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni

J. Comb. Theory, Ser. A, 2014

Principal Ideal Languages and Synchronizing Automata.

Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina

Fundam. Informaticae, 2014

2013

A Coloring Problem for Sturmian and Episturmian Words.

Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Finitely Generated Ideal Languages and Synchronizing Automata.

Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2011

State Complexity of Code Operators.

Elena V. Pribavkina, Emanuele Rodaro

Int. J. Found. Comput. Sci., 2011

Synchronizing automata with finitely many minimal synchronizing words.

Elena V. Pribavkina, Emanuele Rodaro

Inf. Comput., 2011

On Non-complete Sets and Restivo's Conjecture.

Vladimir V. Gusev, Elena V. Pribavkina

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete.

Elena V. Pribavkina, Emanuele Rodaro

Proceedings of the Models of Computation in Context, 2011

2010

On the Minimal Uncompletable Word Problem

Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch

CoRR, 2010

State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages.

Elena V. Pribavkina, Emanuele Rodaro

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Slowly synchronizing automata with zero and incomplete sets

Elena V. Pribavkina

CoRR, 2009

Finitely Generated Synchronizing Automata.

Elena V. Pribavkina, Emanuele Rodaro

Proceedings of the Language and Automata Theory and Applications, 2009

State Complexity For Prefix, Suffix and Bifix operators on regular languages.

Elena V. Pribavkina, Emanuele Rodaro

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2006

On some Properties of the Language of 2-collapsing Words.

Elena V. Pribavkina

Int. J. Found. Comput. Sci., 2006