Slowly synchronizing automata and digraphs
Электронный научный архив УРФУ
Информация об архиве | Просмотр оригинала| Поле | Значение | |
| Заглавие |
Slowly synchronizing automata and digraphs
|
|
| Автор |
Ananichev, D.
Gusev, V. Volkov, M. |
|
| Тематика |
INFINITE SERIES
NUMBER OF STATE PRIMITIVE DIGRAPHS RESET WORDS SYNCHRONIZING AUTOMATA COMPUTER SCIENCE GRAPH THEORY AUTOMATA THEORY |
|
| Описание |
We present several infinite series of synchronizing automatafor which the minimum length of reset words is close to the square of the number of states. These automata are closely related to primitive digraphs with large exponent. © 2010 Springer-Verlag.
2.1.1/3537; Russian Foundation for Basic Research, РФФИ: 09-01-12142, 10-01-00524 Supported by the Russian Foundation for Basic Research, grants 09-01-12142 and 10-01-00524, and by the Federal Education Agency of Russia, grant 2.1.1/3537. |
|
| Дата |
2024-04-24T12:38:26Z
2024-04-24T12:38:26Z 2010 |
|
| Тип |
book-chapter
Other (info:eu-repo/semantics/other) info:eu-repo/submittedVersion |
|
| Идентификатор |
Ananichev, D., Gusev, V., & Volkov, M. (2010). Slowly synchronizing automata and digraphs. In Lecture Notes in Computer Science. Mathematical Foundations of Computer Science 2010 (pp. 55–65). doi:10.1007/978-3-642-15155-2_7
978-3-64215154-5 0302-9743 Final All Open Access, Green https://arxiv.org/pdf/1005.0129 http://elar.urfu.ru/handle/10995/132598 10.1007/978-3-642-15155-2_7 |
|
| Язык |
en
|
|
| Права |
Open access (info:eu-repo/semantics/openAccess)
|
|
| Формат |
application/pdf
|
|
| Издатель |
Springer Berlin Heidelberg
|
|
| Источник |
Lecture Notes in Computer Science
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|