-
1كتاب
المؤلفون: Gusev, V. V., Pribavkina, E. V.
المصدر: Lecture Notes in Computer Science ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
مصطلحات موضوعية: FINITE SET, INFINITE SERIES, COMPLETE SETS, COMPUTER SCIENCE, COMPUTERS, ARTIFICIAL INTELLIGENCE
وصف الملف: application/pdf
العلاقة: Gusev, V. V., & Pribavkina, E. V. (2011). On Non-complete Sets and Restivo’s Conjecture. In Lecture Notes in Computer Science. Developments in Language Theory (pp. 239–250). doi:10.1007/978-3-642-22321-1_21; Final; All Open Access, Green; https://arxiv.org/pdf/1104.0388.pdfTest; http://elar.urfu.ru/handle/10995/132595Test
الإتاحة: https://doi.org/10.1007/978-3-642-22321-1_21Test
http://elar.urfu.ru/handle/10995/132595Test
https://arxiv.org/pdf/1104.0388.pdfTest -
2مؤتمر
المؤلفون: 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
