Please use this identifier to cite or link to this item: http://hdl.handle.net/10995/111369
Title: Slowly Synchronizing Automata and Digraphs
Authors: Ananichev, D.
Gusev, V.
Volkov, M.
Issue Date: 2010
Publisher: Springer Berlin Heidelberg
Citation: Ananichev D. Slowly Synchronizing Automata and Digraphs / D. Ananichev, V. Gusev, M. Volkov. — DOI 10.3390/w13131808 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2010. — Vol. 6281 LNCS. — P. 55-65.
Abstract: 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.
Keywords: INFINITE SERIES
NUMBER OF STATE
PRIMITIVE DIGRAPHS
RESET WORDS
SYNCHRONIZING AUTOMATA
COMPUTER SCIENCE
GRAPH THEORY
AUTOMATA THEORY
URI: http://hdl.handle.net/10995/111369
Access: info:eu-repo/semantics/openAccess
Conference name: 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010
Conference date: 23 August 2010 through 27 August 2010
SCOPUS ID: 78349271216
ISSN: 0302-9743
ISBN: 364215154X
9783642151545
DOI: 10.3390/w13131808
metadata.dc.description.sponsorship: 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.
Appears in Collections:Научные публикации, проиндексированные в SCOPUS и WoS CC

Files in This Item:
File Description SizeFormat 
2-s2.0-78349271216.pdf163,39 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.