Slowly Synchronizing Automata and Digraphs / Ananichev Dmitry,Gusev Vladimir,Volkov Mikhail // . - 2010. - V. 6281, l. . - P. 55-65.

ISSN/EISSN:
0302-9743 / нет данных
Type:
Proceedings Paper
Abstract:
We present several infinite series of synchronizing automata for 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
Author keywords:
CERNY CONJECTURE; SEQUENCES
DOI:
нет данных
Web of Science ID:
ISI:000285031800007
Соавторы в МНС:
Другие поля
Поле Значение
Editor Hlineny, P and Kucera, A
Booktitle MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
Series Lecture Notes in Computer Science
Note 35th International Symposium on Mathematical Foundations of Computer Science, Brno, CZECH REPUBLIC, AUG 23-27, 2010
Organization European Res Consortium Informat \& Math
Publisher SPRINGER-VERLAG BERLIN
Address HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Language English
ISBN 978-3-642-15154-5
Keywords-Plus CERNY CONJECTURE; SEQUENCES
Research-Areas Computer Science; Mathematics
Web-of-Science-Categories Computer Science, Theory \& Methods; Mathematics, Applied
ResearcherID-Numbers Volkov, Mikhail/F-1407-2014
ORCID-Numbers Volkov, Mikhail/0000-0002-9327-243X
Number-of-Cited-References 24
Usage-Count-Last-180-days 1
Usage-Count-Since-2013 16
Doc-Delivery-Number BSN78