المؤلفون: Gonze, F., Gusev, V. V., Jungers, R. M., Gerencsér, B., Volkov, M. V.

المصدر: Int. J. Found. Comput. Sci. ; International Journal of Foundations of Computer Science

مصطلحات موضوعية: AERNÝ'S CONJECTURE, BABAI'S CONJECTURE, PERMUTATION AUTOMATA, SYNCHRONIZING AUTOMATA

وصف الملف: application/pdf

العلاقة: On the Interplay between Aerný and Babai's Conjectures / F. Gonze, V. V. Gusev, R. M. Jungers, et al. — DOI 10.1142/S0129054119400057 // International Journal of Foundations of Computer Science. — 2019. — Vol. 30. — Iss. 1. — P. 93-114.; 1290541; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-85062518493&doi=10.1142%2fS0129054119400057&partnerID=40&md5=5b2dc76d177c6d46a5a848f8343aac91Test; http://elar.urfu.ru/handle/10995/102723Test; 85062518493

الإتاحة: https://doi.org/10.1142/S0129054119400057Test
http://elar.urfu.ru/handle/10995/102723Test

المؤلفون: Gerencsér, B., Gusev, V. V., Jungers, R. M.

المصدر: SIAM J. Matrix Anal. Appl. ; SIAM Journal on Matrix Analysis and Applications

مصطلحات موضوعية: CAREFULLY SYNCHRONIZING AUTOMATA, NONNEGATIVE MATRICES, PRIMITIVE SETS OF MATRICES, THE CERNY CONJECTURE, THE EXPONENT OF A MATRIX SET, COMPUTATIONAL COMPLEXITY, MATRIX ALGEBRA, SYNCHRONIZATION, ASYMPTOTIC ESTIMATES, NON-NEGATIVE MATRIX, PSPACE-COMPLETE, SYNCHRONIZING AUTOMATA, AUTOMATA THEORY

وصف الملف: application/pdf

العلاقة: Gerencsér B. Primitive sets of nonnegative matrices and synchronizing automata / B. Gerencsér, V. V. Gusev, R. M. Jungers. — DOI 10.1137/16M1094099 // SIAM Journal on Matrix Analysis and Applications. — 2018. — Vol. 39. — Iss. 1. — P. 83-98.; 8954798; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045763222&doi=10.1137%2f16M1094099&partnerID=40&md5=4426729d3e79e38e579cb8ca377e5fb1Test; http://elar.urfu.ru/handle/10995/102733Test; 85045763222

الإتاحة: https://doi.org/10.1137/16M1094099Test
http://elar.urfu.ru/handle/10995/102733Test

المؤلفون: Gusev, V. V., Pribavkina, E. V.

المصدر: Int. J. Found. Comput. Sci. ; International Journal of Foundations of Computer Science

مصطلحات موضوعية: DULMAGE-MENDELSOHN-TYPE DIGRAPHS, PRIMITIVE DIGRAPHS, SYNCHRONIZING AUTOMATA, THE CERNÝ CONJECTURE, WIELANDT-TYPE DIGRAPHS

وصف الملف: application/pdf

العلاقة: Gusev V. V. Reset Thresholds of Automata with Two Cycle Lengths / V. V. Gusev, E. V. Pribavkina. — DOI 10.1142/S0129054115400080 // International Journal of Foundations of Computer Science. — 2015. — Vol. 26. — Iss. 7. — P. 953-966.; 1290541; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84952922809&doi=10.1142%2fS0129054115400080&partnerID=40&md5=0ab100433fa6cf7a2a2193e42d0ca3cfTest; http://arxiv.org/pdf/1403.3992Test; http://elar.urfu.ru/handle/10995/102313Test; 84952922809

الإتاحة: https://doi.org/10.1142/S0129054115400080Test
http://elar.urfu.ru/handle/10995/102313Test
http://arxiv.org/pdf/1403.3992Test

المؤلفون: Gusev, V. V., Pribavkina, E. V.

المصدر: Lect. Notes Comput. Sci. ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

مصطلحات موضوعية: DIRECTED GRAPHS, CYCLE LENGTH, MULTIPLE PARAMETERS, POSITIVE INTEGERS, PRIMITIVE DIGRAPHS, SYNCHRONIZING AUTOMATA, AUTOMATA THEORY

وصف الملف: application/pdf

العلاقة: Gusev V. V. Reset thresholds of automata with two cycle lengths / V. V. Gusev, E. V. Pribavkina. — DOI 10.1007/978-3-319-08846-4_15 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2014. — Vol. 8587 LNCS. — P. 200-210.; 3029743; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84958547553&doi=10.1007%2f978-3-319-08846-4_15&partnerID=40&md5=3d533926e107b396752a4684c5526019Test; http://arxiv.org/pdf/1403.3992Test; http://elar.urfu.ru/handle/10995/102292Test; 84958547553

الإتاحة: https://doi.org/10.1007/978-3-319-08846-4_15Test
http://elar.urfu.ru/handle/10995/102292Test
http://arxiv.org/pdf/1403.3992Test

المؤلفون: Gusev, V. V.

المصدر: Lect. Notes Comput. Sci. ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

مصطلحات موضوعية: ARTIFICIAL INTELLIGENCE, COMPUTER SCIENCE, COMPUTERS, NUMBER OF STATE, RANDOM INPUT, SYNCHRONIZING AUTOMATA, AUTOMATA THEORY

وصف الملف: application/pdf

العلاقة: Gusev V. V. Synchronizing automata with random inputs (Short Paper) / V. V. Gusev. — DOI 10.1007/978-3-319-09698-8_7 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2014. — Vol. 8633 LNCS. — P. 68-75.; 3029743; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84958536428&doi=10.1007%2f978-3-319-09698-8_7&partnerID=40&md5=d0284f8b5d6ea071e2db7180207bb4c6Test; http://arxiv.org/pdf/1404.6731.pdfTest; http://elar.urfu.ru/handle/10995/102296Test; 84958536428

الإتاحة: https://doi.org/10.1007/978-3-319-09698-8_7Test
http://elar.urfu.ru/handle/10995/102296Test
http://arxiv.org/pdf/1404.6731.pdfTest

المؤلفون: Gusev, V. V., Maslennikova, M. I., Pribavkina, E. V.

المصدر: Lect. Notes Comput. Sci. ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

مصطلحات موضوعية: IDEAL LANGUAGE, RESET COMPLEXITY, SYNCHRONIZING AUTOMATON, SYNCHRONIZING WORD, AUTOMATA THEORY, COMBINATORIAL MATHEMATICS, SYNCHRONIZATION, DE BRUIJN GRAPHS, STRONGLY CONNECTED, SYNCHRONIZING AUTOMATA, SYNCHRONIZING WORDS, ROBOTS

وصف الملف: application/pdf

العلاقة: Gusev V. V. Finitely generated ideal languages and synchronizing automata / V. V. Gusev, M. I. Maslennikova, E. V. Pribavkina. — DOI 10.1007/978-3-642-40579-2_16 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2013. — Vol. 8079 LNCS. — P. 143-153.; 3029743; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885997125&doi=10.1007%2f978-3-642-40579-2_16&partnerID=40&md5=805ac08dee75d6a36caddbc9da7ee4a1Test; http://arxiv.org/pdf/1305.0336Test; http://elar.urfu.ru/handle/10995/102498Test; 84885997125

الإتاحة: https://doi.org/10.1007/978-3-642-40579-2_16Test
http://elar.urfu.ru/handle/10995/102498Test
http://arxiv.org/pdf/1305.0336Test

المؤلفون: Gusev, V. V.

المصدر: Lect. Notes Comput. Sci. ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

مصطلحات موضوعية: EULERIAN, LOWER BOUNDS, REACHABILITY, RESET WORDS, SYNCHRONIZING AUTOMATA, underLYING GRAPHS, AUTOMATA THEORY

وصف الملف: application/pdf

العلاقة: Gusev V. V. Lower Bounds for the Length of Reset words in Eulerian Automata / V. V. Gusev // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2011. — Vol. 6945 LNCS. — P. 180-190.; All Open Access, Green; http://elar.urfu.ru/handle/10995/112091Test; 80053330436

الإتاحة: http://elar.urfu.ru/handle/10995/112091Test

المؤلفون: Gusev, V. V., Maslennikova, M. I., Pribavkina, E. V.

المصدر: Fundam Inf ; Fundamenta Informaticae

مصطلحات موضوعية: IDEAL LANGUAGE, STRONGLY CONNECTED AUTOMATON, SYNCHRONIZING AUTOMATON, SYNCHRONIZING WORD, SYNTACTIC COMPLEXITY, ALGORITHMS, SYNCHRONIZATION, SYNTACTICS, STRONGLY CONNECTED AUTOMATONS, SYNCHRONIZING AUTOMATA, SYNCHRONIZING WORDS, AUTOMATA THEORY

وصف الملف: application/pdf

العلاقة: Gusev V. V. Principal ideal languages and synchronizing automata / V. V. Gusev, M. I. Maslennikova, E. V. Pribavkina. — DOI 10.3233/FI-2014-1034 // Fundamenta Informaticae. — 2014. — Vol. 132. — Iss. 1. — P. 95-108.; 1692968; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901774572&doi=10.3233%2fFI-2014-1034&partnerID=40&md5=ab5d712be8c2a42039b8740be97306b7Test; http://arxiv.org/pdf/1304.3307Test; http://elar.urfu.ru/handle/10995/102458Test; 84901774572

الإتاحة: https://doi.org/10.3233/FI-2014-1034Test
http://elar.urfu.ru/handle/10995/102458Test
http://arxiv.org/pdf/1304.3307Test

المؤلفون: Gusev, V. V.

المصدر: International Journal of Foundations of Computer Science

مصطلحات موضوعية: ČERNÝ CONJECTURE, EXPONENT OF DIGRAPH, SYNCHRONIZING AUTOMATA

وصف الملف: application/pdf

العلاقة: Gusev V. V. Lower bounds for the length of reset words in eulerian automata / V. V. Gusev // International Journal of Foundations of Computer Science. — 2013. — Vol. 24. — № 2. — P. 251-262.; b8e6d93c-d1e5-426f-9e4d-df5e91ec4604; http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84878709355Test; http://elar.urfu.ru/handle/10995/27138Test; 84878709355; 000319838100006

الإتاحة: https://doi.org/10.1142/S0129054113400108Test
http://elar.urfu.ru/handle/10995/27138Test
http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=84878709355Test

المؤلفون: Ananichev, D. S., Gusev, V. V.

المصدر: Fundamenta Informaticae.

مصطلحات موضوعية: approximation algorithm, greedy algorithm, inapproximability, reset threshold, synchronizing automata, synchronizing word

الوصول الحر: http://yadda.icm.edu.pl/baztech/element/bwmeta1.element.baztech-ade86093-3243-429c-94ef-5fbe48a01f07Test