• 24 Citations
  • 3 h-Index
20132017
If you made any changes in Pure these will be visible here soon.

Research Output 2013 2017

  • 24 Citations
  • 3 h-Index
  • 5 Article
  • 3 Conference contribution
2017

Generalized primitivity of labeled digraphs

Gusev, V. V., Jungers, R. M. & Pribavkina, E. V., 1 Aug 2017, In : Electronic Notes in Discrete Mathematics. 61, p. 549-555 7 p.

Research output: Contribution to journalArticleResearchpeer-review

Digraph
Group theory
Semigroup
Computational complexity
Nonnegative Matrices
2016

On synchronizing colorings and the eigenvectors of digraphs

Gusev, V. V. & Pribavkina, E. V., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 58. 48

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Coloring
Eigenvalues and eigenfunctions
Finite automata
Labels
2015
2 Citations (Scopus)

Reset Thresholds of Automata with Two Cycle Lengths

Gusev, V. V. & Pribavkina, E. V., 1 Nov 2015, In : International Journal of Foundations of Computer Science. 26, 7, p. 953-966 14 p.

Research output: Contribution to journalArticleResearchpeer-review

Coloring
2014
6 Citations (Scopus)

A coloring problem for infinite words

de Luca, A., Pribavkina, E. V. & Zamboni, L. Q., Jul 2014, In : Journal of Combinatorial Theory. Series A. 125, 1, p. 306-332 27 p.

Research output: Contribution to journalArticleResearchpeer-review

Infinite Words
Coloring
Factorization
Colouring
Color
3 Citations (Scopus)

Principal Ideal Languages and Synchronizing Automata

Gusev, V. V., Maslennikova, M. I. & Pribavkina, E. V., 2014, In : Fundamenta Informaticae. 132, 1, p. 95-108 14 p.

Research output: Contribution to journalArticleResearchpeer-review

Syntactics
Automata
Calculate
Language
5 Citations (Scopus)

Reset Thresholds of Automata with Two Cycle Lengths

Gusev, V. V. & Pribavkina, E. V., 2014, IMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2014. Holzer, M. & Kutrib, M. (eds.). Springer Verlag, Vol. 8587 LNCS. p. 200-210 11 p. (Lecture Notes in Computer Science; vol. 8587).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Cycle Length
Automata
Primitive Digraph
Cycle
Colouring
2013
1 Citation (Scopus)

A coloring problem for Sturmian and episturmian words

De Luca, A., Pribavkina, E. V. & Zamboni, L. Q., 2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7907 LNCS. p. 191-202 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7907 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Coloring
Colouring
Sturmian Words
Ramsey Theory
Infinite Words
7 Citations (Scopus)
Finitely Generated
Automata
De Bruijn Graph
Language