Synchronizing Automata with a Letter of Deficiency 2

Please use this identifier to cite or link to this item: http://elar.urfu.ru/handle/10995/112096

Title:	Synchronizing Automata with a Letter of Deficiency 2
Authors:	Ananichev, D. S. Volkov, M. V. Zaks, Yu. I.
Issue Date:	2006
Publisher:	Springer Verlag Springer Berlin Heidelberg
Citation:	Ananichev D. S. Synchronizing Automata with a Letter of Deficiency 2 / D. S. Ananichev, M. V. Volkov, Yu. I. Zaks // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2006. — Vol. 4036 LNCS. — P. 433-442.
Abstract:	We present two infinite series of synchronizing automata with a letter of deficiency 2 whose shortest reset words are longer than those for synchronizing automata obtained by a straightforward modification of Černý's construction. © Springer-Verlag Berlin Heidelberg 2006.
Keywords:	COMPUTER SCIENCE FORMAL LANGUAGES PROBLEM SOLVING SYNCHRONIZATION DEFICIENCY 2 INFINITE SERIES RESET WORDS AUTOMATA THEORY
URI:	http://elar.urfu.ru/handle/10995/112096
Access:	info:eu-repo/semantics/openAccess
Conference name:	10th International Conference on Developments in Language Theory, DLT 2006
Conference date:	26 June 2006 through 29 June 2006
SCOPUS ID:	33746215726
WOS ID:	000239454100039
PURE ID:	7882422
ISSN:	0302-9743
ISBN:	354035428X 9783540354284
metadata.dc.description.sponsorship:	This work was supported by the Russian Foundation for Basic Research, grant 05-01-00540.
Appears in Collections:	Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC

Files in This Item:

File	Description	Size	Format
2-s2.0-33746215726.pdf		407,46 kB	Adobe PDF	View/Open